Skip to content
DraconiticResearch
Search Sources API
194,067 studies31 sourcesUpdated 2 min ago
PreprintarXiv licencearXiv

Convergence analysis of TriCG and TriMR for symmetric quasi-definite linear systems

Abstract

TriCG and TriMR are two short-recurrence iterative methods introduced by Montoison and Orban [SIAM J.\ Sci.\ Comput., 43 (2021), pp.\ A2502--A2525] for solving symmetric quasi-definite linear systems. Extensive numerical experiments have demonstrated the efficiency of these two methods, but a systematic convergence analysis is still lacking. In this paper, we derive convergence bounds for the TriCG error norm and the TriMR residual norm. Numerical experiments support the theoretical results.

Related

  1. A variant of the block preconditioner for indefinite complex symmetric linear systems
    Mehdi Makhdomi, Davod Khojasteh Salkuyeh
    arXivPreprintCC0Full textNumerical analysis & scientific computingarXiv
  2. Symmetric Hermite quadrature-based balanced truncation for learning linear dynamical systems from derivative data
    Sean Reiter, Steffen W. R. Werner
    arXivPreprintarXiv licenceFull textDynamical systemsNumerical analysis & scientific computingarXiv
  3. Geometric Feature Learning for Functional Data Valued on the Symmetric Positive Definite Manifold
    Samuel V. Singh, Mimi Zhang
    arXivPreprintCC BY-NC-SA 4.0Full textStatisticsarXiv
  4. On Convergence Behavior of Randomized Kaczmarz-type Methods for Solving Doubly Noisy Linear Systems
    Yudan Gan, Gang Wu
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Global classification of oscillatory dynamics in symmetric zero-divergence 3D piecewise-linear Filippov systems with a visible--visible two-fold
    Samuel Carlos S. Ferreira
    arXivPreprintCC BY-NC-ND 4.0Full textDynamical systemsarXiv
BibTeX
@misc{du2026convergence,
  title = {{Convergence analysis of TriCG and TriMR for symmetric quasi-definite linear systems}},
  author = {Kui Du and Jia-Jun Fan},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.04189},
  eprint = {2611.04189},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.04189},
}
RIS
TY  - UNPB
TI  - Convergence analysis of TriCG and TriMR for symmetric quasi-definite linear systems
AU  - Kui Du
AU  - Jia-Jun Fan
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2611.04189
UR  - https://arxiv.org/abs/2611.04189
AB  - TriCG and TriMR are two short-recurrence iterative methods introduced by Montoison and Orban [SIAM J.\ Sci.\ Comput., 43 (2021), pp.\ A2502--A2525] for solving symmetric quasi-definite linear systems. Extensive numerical experiments have demonstrated the efficiency of these two methods, but a systematic convergence analysis is still lacking. In this paper, we derive convergence bounds for the TriCG error norm and the TriMR residual norm. Numerical experiments support the theoretical results.
ER  -