级联多重级算法用于对称鞍点系统
Cascadic Multilevel Algorithms for Symmetric Saddle Point Systems
AI总结:
本文提出一种多级算法,用于近似对称鞍点系统的变分公式。该算法基于稳定有限元对族和快速准确求解对称正定系统的能力,通过级联原则实现高效迭代,理论和实验表明其能实现最优或接近最优的逼近率。
摘要:
本文介绍了一种多级算法,用于近似对称鞍点系统的变分公式。该算法基于稳定有限元对族和快速准确求解对称正定系统的存在性。在每个固定级别上,使用梯度或共轭梯度算法高效求解Schur补的逆。级别变换准则遵循级联原则,要求迭代误差接近预期的离散化误差。我们证明了新的估计,将迭代误差与约束方程残差联系起来。这些新估计是高效级别变换准则的关键。每个新级别首次迭代使用前一层次对离散解最佳逼近的信息。理论结果和实验表明,该算法通过每个级别进行非递增次数的迭代,实现最优或接近最优的逼近率。尽管数值结果支持算法效率的Stokes系统被展示,但该算法可应用于广泛边界值问题,包括可连续重新表述为对称鞍点问题的一阶系统,如Maxwell方程。
英文摘要:
In this paper, we introduce a multilevel algorithm for approximating variational formulations of symmetric saddle point systems. The algorithm is based on availability of families of stable finite element pairs and on the availability of fast and accurate solvers for it symmetric positive definite systems. On each fixed level an efficient solver such as the gradient or the conjugate gradient algorithm for inverting a Schur complement is implemented. The level change criterion follows the cascade principle and requires that the iteration error be close to the expected discretization error. We prove new estimates that relate the iteration error and the residual for the constraint equation. The new estimates are the key ingredients in imposing an efficient level change criterion. The first iteration on each new level uses information about the best approximation of the discrete solution from the previous level. The theoretical results and experiments show that the algorithms achieve optimal or close to optimal approximation rates by performing a non-increasing number of iterations on each level. Even though numerical results supporting the efficiency of the algorithms are presented for the Stokes system, the algorithms can be applied to a large class of boundary value problems, including first order systems that can be reformulated at the continuous level as symmetric saddle point problems, such as the Maxwell equations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。