Eigenvalue Bounds for Symmetric, Multiple Saddle-Point Matrices with SPD Preconditioners
Algorithms · 04.05.2026 · 19 (5) · 359
DOI: 10.3390/a19050359 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 04.05.2026. Verfasst von Luca Bergamaschi und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 40 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We derive the eigenvalue bounds for symmetric block-tridiagonal multiple saddle-point systems preconditioned with the symmetric positive definite (SPD) preconditioner proposed by J. Pearson and A. Potschka in 2024 and further studied by L. Bergamaschi and coauthors, and for double saddle-point problems with inexact Schur complement matrices. The analysis applies to an arbitrary number of blocks. We validate the proposed estimates with both synthetic and realistic test problems, and show the good performance of the proposed preconditioner under the condition that the Schur complements are accurately approximated.
Zitieren
APA
Bergamaschi, L., & Bergamaschi, M. (2026). Eigenvalue Bounds for Symmetric, Multiple Saddle-Point Matrices with SPD Preconditioners. Algorithms, 19(5), 359. https://doi.org/10.3390/a19050359
Vancouver
Bergamaschi L, Bergamaschi M. Eigenvalue Bounds for Symmetric, Multiple Saddle-Point Matrices with SPD Preconditioners. Algorithms. 2026;19(5):359. doi:10.3390/a19050359
BibTeX
@article{Bergamaschi2026,
author = {Bergamaschi, Luca and Bergamaschi, Michele},
title = {Eigenvalue Bounds for Symmetric, Multiple Saddle-Point Matrices with SPD Preconditioners},
journal = {Algorithms},
year = {2026},
volume = {19},
number = {5},
pages = {359},
doi = {10.3390/a19050359}
}
EUVIMED