IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i16p1974-d616835.html
   My bibliography  Save this article

Bayesian Estimation of Adsorption and Desorption Parameters for Pore Scale Transport

Author

Listed:
  • Vasiliy V. Grigoriev

    (Multiscale Model Reduction Laboratory, North-Eastern Federal University, 58 Belinskogo St., 677000 Yakutsk, Russia)

  • Petr N. Vabishchevich

    (Multiscale Model Reduction Laboratory, North-Eastern Federal University, 58 Belinskogo St., 677000 Yakutsk, Russia
    Nuclear Safety Institute, Russian Academy of Sciences, 52, B. Tulskaya, 115191 Moscow, Russia)

Abstract

Stochastic parameter estimation and inversion have become increasingly popular in recent years. Nowadays, it is computationally reasonable and regular to solve complex inverse problems within the Bayesian framework. Applications of Bayesian inferences for inverse problems require investigation of the posterior distribution, which usually has a complex landscape and is highly dimensional. In these cases, Markov chain Monte Carlo methods (MCMC) are often used. This paper discusses a Bayesian approach for identifying adsorption and desorption rates in combination with a pore-scale reactive flow. Markov chain Monte Carlo sampling is used to estimate adsorption and desorption rates. The reactive transport in porous media is governed by incompressible Stokes equations, coupled with convection–diffusion equation for species’ transport. Adsorption and desorption are accounted via Robin boundary conditions. The Henry isotherm is considered for describing the reaction terms. The measured concentration at the outlet boundary is provided as additional information for the identification procedure. Metropolis–Hastings and Adaptive Metropolis algorithms are implemented. Credible intervals have been plotted from sampled posterior distributions for both algorithms. The impact of the noise in the measurements and influence of several measurements for Bayesian identification procedure is studied. Sample analysis using the autocorrelation function and acceptance rate is performed to estimate mixing of the Markov chain. As result, we conclude that MCMC sampling algorithm within the Bayesian framework is good enough to determine an admissible set of parameters via credible intervals.

Suggested Citation

  • Vasiliy V. Grigoriev & Petr N. Vabishchevich, 2021. "Bayesian Estimation of Adsorption and Desorption Parameters for Pore Scale Transport," Mathematics, MDPI, vol. 9(16), pages 1-16, August.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:16:p:1974-:d:616835
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/16/1974/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/16/1974/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Peter Cassey & Andrew Heathcote & Scott D Brown, 2014. "Brain and Behavior in Decision-Making," PLOS Computational Biology, Public Library of Science, vol. 10(7), pages 1-8, July.
    2. Anatoly Zhigljavsky & Antanas Žilinskas, 2008. "Stochastic Global Optimization," Springer Optimization and Its Applications, Springer, number 978-0-387-74740-8, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrey Pepelyshev & Anatoly Zhigljavsky & Antanas Žilinskas, 2018. "Performance of global random search algorithms for large dimensions," Journal of Global Optimization, Springer, vol. 71(1), pages 57-71, May.
    2. Jonathan Gillard & Anatoly Zhigljavsky, 2013. "Optimization challenges in the structured low rank approximation problem," Journal of Global Optimization, Springer, vol. 57(3), pages 733-751, November.
    3. Nazih-Eddine Belkacem & Lakhdar Chiter & Mohammed Louaked, 2024. "A Novel Approach to Enhance DIRECT -Type Algorithms for Hyper-Rectangle Identification," Mathematics, MDPI, vol. 12(2), pages 1-24, January.
    4. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    5. C. J. Price & M. Reale & B. L. Robertson, 2021. "Oscars-ii: an algorithm for bound constrained global optimization," Journal of Global Optimization, Springer, vol. 79(1), pages 39-57, January.
    6. Anatoly Zhigljavsky & Emily Hamilton, 2010. "Stopping rules in k-adaptive global random search algorithms," Journal of Global Optimization, Springer, vol. 48(1), pages 87-97, September.
    7. M. Gaviano & D. Lera & A. Steri, 2010. "A local search method for continuous global optimization," Journal of Global Optimization, Springer, vol. 48(1), pages 73-85, September.
    8. Ratko Grbić & Emmanuel Nyarko & Rudolf Scitovski, 2013. "A modification of the DIRECT method for Lipschitz global optimization for a symmetric function," Journal of Global Optimization, Springer, vol. 57(4), pages 1193-1212, December.
    9. Moody Chu & Matthew Lin & Liqi Wang, 2014. "A study of singular spectrum analysis with global optimization techniques," Journal of Global Optimization, Springer, vol. 60(3), pages 551-574, November.
    10. Victor Gergel & Evgeny Kozinov, 2018. "Efficient multicriterial optimization based on intensive reuse of search information," Journal of Global Optimization, Springer, vol. 71(1), pages 73-90, May.
    11. Ferreiro-Ferreiro, Ana M. & García-Rodríguez, José A. & Souto, Luis & Vázquez, Carlos, 2019. "Basin Hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 282-298.
    12. Yaroslav D. Sergeyev & Marat S. Mukhametzhanov & Dmitri E. Kvasov & Daniela Lera, 2016. "Derivative-Free Local Tuning and Local Improvement Techniques Embedded in the Univariate Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 186-208, October.
    13. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    14. James Calvin, 2010. "A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise," Journal of Global Optimization, Springer, vol. 48(1), pages 17-27, September.
    15. Daniela Lera & Yaroslav Sergeyev, 2010. "An information global minimization algorithm using the local improvement technique," Journal of Global Optimization, Springer, vol. 48(1), pages 99-112, September.
    16. Daniela Lera & Yaroslav D. Sergeyev, 2018. "GOSH: derivative-free global optimization using multi-dimensional space-filling curves," Journal of Global Optimization, Springer, vol. 71(1), pages 193-211, May.
    17. Linas Stripinis & Remigijus Paulavičius, 2022. "Experimental Study of Excessive Local Refinement Reduction Techniques for Global Optimization DIRECT-Type Algorithms," Mathematics, MDPI, vol. 10(20), pages 1-18, October.
    18. James Calvin & Gražina Gimbutienė & William O. Phillips & Antanas Žilinskas, 2018. "On convergence rate of a rectangular partition based global optimization algorithm," Journal of Global Optimization, Springer, vol. 71(1), pages 165-191, May.
    19. Remigijus Paulavičius & Julius Žilinskas, 2014. "Simplicial Lipschitz optimization without the Lipschitz constant," Journal of Global Optimization, Springer, vol. 59(1), pages 23-40, May.
    20. Kvasov, Dmitri E. & Mukhametzhanov, Marat S., 2018. "Metaheuristic vs. deterministic global optimization algorithms: The univariate case," Applied Mathematics and Computation, Elsevier, vol. 318(C), pages 245-259.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:9:y:2021:i:16:p:1974-:d:616835. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.