Maxime Jonval , Ibtihel Ben Gharbia , Clément Cancès , Thibault Faney , Quang-Huy Tran
{"title":"用于稳健解决化学平衡问题的参数化和笛卡尔表示技术","authors":"Maxime Jonval , Ibtihel Ben Gharbia , Clément Cancès , Thibault Faney , Quang-Huy Tran","doi":"10.1016/j.jcp.2024.113596","DOIUrl":null,"url":null,"abstract":"<div><div>Chemical equilibria computations, especially those with vanishing species in the aqueous phase, lead to nonlinear systems that are difficult to solve due to gradient blow up. Instead of the commonly used <em>ad hoc</em> treatments, we propose two reformulations of the single-phase chemical equilibrium problem which are in line with the spirit of preconditioning but whose actual aims are to guarantee a better stability of Newton's method. The first reformulation is a parametrization of the graph linking species mole fractions to their chemical potentials. The second is based on an augmented system where this relationship is relaxed for the iterates by means of a Cartesian representation. We theoretically prove the local quadratic convergence of Newton's method for both reformulations. From a numerical point of view, we demonstrate that the two techniques are accurate, allowing to compute equilibria with chemical species having very low concentrations. Moreover, the robustness of our methods combined with a globalization strategy is superior to that of the literature.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"522 ","pages":"Article 113596"},"PeriodicalIF":3.8000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parametrization and Cartesian representation techniques for robust resolution of chemical equilibria\",\"authors\":\"Maxime Jonval , Ibtihel Ben Gharbia , Clément Cancès , Thibault Faney , Quang-Huy Tran\",\"doi\":\"10.1016/j.jcp.2024.113596\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Chemical equilibria computations, especially those with vanishing species in the aqueous phase, lead to nonlinear systems that are difficult to solve due to gradient blow up. Instead of the commonly used <em>ad hoc</em> treatments, we propose two reformulations of the single-phase chemical equilibrium problem which are in line with the spirit of preconditioning but whose actual aims are to guarantee a better stability of Newton's method. The first reformulation is a parametrization of the graph linking species mole fractions to their chemical potentials. The second is based on an augmented system where this relationship is relaxed for the iterates by means of a Cartesian representation. We theoretically prove the local quadratic convergence of Newton's method for both reformulations. From a numerical point of view, we demonstrate that the two techniques are accurate, allowing to compute equilibria with chemical species having very low concentrations. Moreover, the robustness of our methods combined with a globalization strategy is superior to that of the literature.</div></div>\",\"PeriodicalId\":352,\"journal\":{\"name\":\"Journal of Computational Physics\",\"volume\":\"522 \",\"pages\":\"Article 113596\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2024-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021999124008441\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021999124008441","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Parametrization and Cartesian representation techniques for robust resolution of chemical equilibria
Chemical equilibria computations, especially those with vanishing species in the aqueous phase, lead to nonlinear systems that are difficult to solve due to gradient blow up. Instead of the commonly used ad hoc treatments, we propose two reformulations of the single-phase chemical equilibrium problem which are in line with the spirit of preconditioning but whose actual aims are to guarantee a better stability of Newton's method. The first reformulation is a parametrization of the graph linking species mole fractions to their chemical potentials. The second is based on an augmented system where this relationship is relaxed for the iterates by means of a Cartesian representation. We theoretically prove the local quadratic convergence of Newton's method for both reformulations. From a numerical point of view, we demonstrate that the two techniques are accurate, allowing to compute equilibria with chemical species having very low concentrations. Moreover, the robustness of our methods combined with a globalization strategy is superior to that of the literature.
期刊介绍:
Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries.
The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.