arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2405.03415math.NAcs.NAmath.AP
收藏

梯度流拉格朗日乘子法的唯一可解性与误差分析

Unique solvability and error analysis of the Lagrange multiplier approach for gradient flows

Qing Cheng, Jie Shen, Cheng Wang

AI总结:

本文针对梯度流的原始拉格朗日乘子法,给出唯一可解性的充分必要条件并提出修正方法,以 Cahn-Hilliard 方程为例证明二阶格式的唯一可解性与最优误差估计,数值实验表明修正方法更鲁棒且允许更大时间步长。

摘要:

本文研究了文献[8]中针对梯度流提出的原始拉格朗日乘子法的唯一可解性与误差分析。我们给出了原始拉格朗日乘子法所产生的非线性代数方程在其精确解邻域内存在唯一解所必须满足的一个充分必要条件,并提出了一种修正的拉格朗日乘子法,使得即使上述条件不满足,计算仍可继续进行。以 Cahn-Hilliard 方程为例,在该条件成立且时间步长足够小的假设下,我们严格证明了一个二阶拉格朗日乘子格式的唯一可解性,并建立了最优误差估计。数值结果表明,与原始拉格朗日乘子法相比,修正的拉格朗日乘子法具有更强的鲁棒性,并且可以使用大得多的时间步长。

英文摘要:

The unique solvability and error analysis of the original Lagrange multiplier approach proposed in [8] for gradient flows is studied in this paper. We identify a necessary and sufficient condition that must be satisfied for the nonlinear algebraic equation arising from the original Lagrange multiplier approach to admit a unique solution in the neighborhood of its exact solution, and propose a modified Lagrange multiplier approach so that the computation can continue even if the aforementioned condition is not satisfied. Using Cahn-Hilliard equation as an example, we prove rigorously the unique solvability and establish optimal error estimates of a second-order Lagrange multiplier scheme assuming this condition and that the time step is sufficient small. We also present numerical results to demonstrate that the modified Lagrange multiplier approach is much more robust and can use much larger time step than the original Lagrange multiplier approach.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑