Some preconditioning techniques for a class of double saddle point problems

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS(2024)

引用 0|浏览2
暂无评分
摘要
In this paper, we describe and analyze the spectral properties of several exact block preconditioners for a class of double saddle point problems. Among all these, we consider an inexact version of a block triangular preconditioner providing extremely fast convergence of the (F)GMRES method. We develop a spectral analysis of the preconditioned matrix showing that the complex eigenvalues lie in a circle of center (1,0)$$ \left(1,0\right) $$ and radius 1, while the real eigenvalues are described in terms of the roots of a third order polynomial with real coefficients. Numerical examples are reported to illustrate the efficiency of inexact versions of the proposed preconditioners, and to verify the theoretical bounds.
更多
查看译文
关键词
double saddle point problems,Krylov subspace methods,preconditioning
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要