{"title":"A very simple, efficient and accurate dynamic interpolation BFGS algorithm for three-dimensional moment of fluid method","authors":"Deng Wang , Zupeng Jia","doi":"10.1016/j.cnsns.2026.109755","DOIUrl":null,"url":null,"abstract":"<div><div>The Moment of Fluid (MOF) method is a widely used and accurate interface reconstruction method. It performs iterations to solve an implicit nonlinear optimization problem to obtain the optimal approximate interface. As far as we know, the current optimization algorithms employed in MOF methods all directly minimize the implicit objective function, and the interface reconstruction procedure has to be executed for each calculation of the objective function, which is very expensive. There have been numerous measures to improve the computational efficiency, accuracy and robustness of the MOF method, but we will achieve the improvements from a new perspective. In this paper, a very simple, efficient and accurate dynamic interpolation BFGS (DIBFGS) algorithm is proposed, based on the classical Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. The new algorithm introduces a dynamic interpolation function to approximate the implicit objective function during the optimization process. The dynamic interpolation function is explicit and the interpolation nodes utilized for constructing it are dynamically selected from a gradually expanding set of candidate interpolation nodes. The new algorithm minimizes the dynamic interpolation function instead of the original objective function, thus the number of original objective function calculations will be significantly reduced and the computational efficiency can be improved. Moreover, in previous MOF methods, the gradient of the objective function involved in the iterations are either estimated by finite difference approximation or derived analytically with complex analyses, both of which require interface reconstruction. On the contrary, our algorithm uses the analytical gradient of the interpolation function, which is also explicit and quite easy to calculate. Then the accuracy, convergence rate as well as robustness of the iteration process can be improved. Last but not least, our algorithm is very simple and easy to code. A variety of numerical tests collectively show that compared to the MOF method using BFGS algorithm, our new method can not only effectively reduce the number of original objective function calculations and computational time, but also improve the accuracy and robustness particularly in complex cases with large interface deformations.</div></div>","PeriodicalId":50658,"journal":{"name":"Communications in Nonlinear Science and Numerical Simulation","volume":"157 ","pages":"Article 109755"},"PeriodicalIF":3.8000,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Nonlinear Science and Numerical Simulation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1007570426001164","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/16 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
The Moment of Fluid (MOF) method is a widely used and accurate interface reconstruction method. It performs iterations to solve an implicit nonlinear optimization problem to obtain the optimal approximate interface. As far as we know, the current optimization algorithms employed in MOF methods all directly minimize the implicit objective function, and the interface reconstruction procedure has to be executed for each calculation of the objective function, which is very expensive. There have been numerous measures to improve the computational efficiency, accuracy and robustness of the MOF method, but we will achieve the improvements from a new perspective. In this paper, a very simple, efficient and accurate dynamic interpolation BFGS (DIBFGS) algorithm is proposed, based on the classical Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. The new algorithm introduces a dynamic interpolation function to approximate the implicit objective function during the optimization process. The dynamic interpolation function is explicit and the interpolation nodes utilized for constructing it are dynamically selected from a gradually expanding set of candidate interpolation nodes. The new algorithm minimizes the dynamic interpolation function instead of the original objective function, thus the number of original objective function calculations will be significantly reduced and the computational efficiency can be improved. Moreover, in previous MOF methods, the gradient of the objective function involved in the iterations are either estimated by finite difference approximation or derived analytically with complex analyses, both of which require interface reconstruction. On the contrary, our algorithm uses the analytical gradient of the interpolation function, which is also explicit and quite easy to calculate. Then the accuracy, convergence rate as well as robustness of the iteration process can be improved. Last but not least, our algorithm is very simple and easy to code. A variety of numerical tests collectively show that compared to the MOF method using BFGS algorithm, our new method can not only effectively reduce the number of original objective function calculations and computational time, but also improve the accuracy and robustness particularly in complex cases with large interface deformations.
期刊介绍:
The journal publishes original research findings on experimental observation, mathematical modeling, theoretical analysis and numerical simulation, for more accurate description, better prediction or novel application, of nonlinear phenomena in science and engineering. It offers a venue for researchers to make rapid exchange of ideas and techniques in nonlinear science and complexity.
The submission of manuscripts with cross-disciplinary approaches in nonlinear science and complexity is particularly encouraged.
Topics of interest:
Nonlinear differential or delay equations, Lie group analysis and asymptotic methods, Discontinuous systems, Fractals, Fractional calculus and dynamics, Nonlinear effects in quantum mechanics, Nonlinear stochastic processes, Experimental nonlinear science, Time-series and signal analysis, Computational methods and simulations in nonlinear science and engineering, Control of dynamical systems, Synchronization, Lyapunov analysis, High-dimensional chaos and turbulence, Chaos in Hamiltonian systems, Integrable systems and solitons, Collective behavior in many-body systems, Biological physics and networks, Nonlinear mechanical systems, Complex systems and complexity.
No length limitation for contributions is set, but only concisely written manuscripts are published. Brief papers are published on the basis of Rapid Communications. Discussions of previously published papers are welcome.