Eigenvalue bounds for preconditioned symmetric multiple saddle-point matrices
By: L. Bergamaschi , A. Martinez , J. W. Pearson and more
Potential Business Impact:
Speeds up computer solving of complex math problems.
We develop eigenvalue bounds for symmetric, block tridiagonal multiple saddle-point linear systems, preconditioned with block diagonal matrices. We extend known results for $3 \times 3$ block systems [Bradley and Greif, IMA J.\ Numer. Anal. 43 (2023)] and for $4 \times 4$ systems [Pearson and Potschka, IMA J. Numer. Anal. 44 (2024)] to an arbitrary number of blocks. Moreover, our results generalize the bounds in [Sogn and Zulehner, IMA J. Numer. Anal. 39 (2018)], developed for an arbitrary number of blocks with null diagonal blocks. Extension to the bounds when the Schur complements are approximated is also provided, using perturbation arguments. Practical bounds are also obtained for the double saddle-point linear system. Numerical experiments validate our findings.
Similar Papers
Triangular preconditioners for double saddle point linear systems arising in the mixed form of poroelasticity equations
Numerical Analysis
Solves hard math problems faster for science.
Scalable augmented Lagrangian preconditioners for fictitious domain problems
Numerical Analysis
Speeds up computer math for science problems.
Polynomial and Parallelizable Preconditioning for Block Tridiagonal Positive Definite Matrices
Optimization and Control
Speeds up robots solving hard math problems.