Admissible and attainable convergence behavior with stagnation mirroring in restarted (block) GMRES

In this work, we describe how to construct matrices and block right-hand sides that exhibit a specified restarted block Gmres convergence pattern, such that the eigenvalues and Ritz values at each iteration can be chosen independent of the specified convergence behavior. This work is a generalization of the work in (Meurant and Tebbens, Num. Alg. 84(4), 1329–1352 2019) in which the authors do the same for restarted non-block Gmres . We use the same tools as were used in (Kubínová and Soodhalter, SIAM J. Matrix Anal. Appl. 41(2)464–486 2020), namely to analyze block Gmres as an iteration over a right vector space with scalars from the $$^*$$ -algebra of matrices. To facilitate our work, we also extend the work of Meurant and Tebbens and offer alternative proofs of some of their results, that can be more easily generalized to the block setting.

Authors

Institutions

Publication Details

Journal
Numerical Algorithms
Published
2026-04-27
DOI
https://doi.org/10.1007/s11075-026-02368-x
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Admissible and attainable convergence behavior with stagnation mirroring in restarted (block) GMRES

Kirk M. Soodhalter
Numerical Algorithms
Matrix Theory and Algorithms
article

Admissible and attainable convergence behavior with stagnation mirroring in restarted (block) GMRES

Kirk M. Soodhalter
article en

Abstract

In this work, we describe how to construct matrices and block right-hand sides that exhibit a specified restarted block Gmres convergence pattern, such that the eigenvalues and Ritz values at each iteration can be chosen independent of the specified convergence behavior. This work is a generalization of the work in (Meurant and Tebbens, Num. Alg. 84(4), 1329–1352 2019) in which the authors do the same for restarted non-block Gmres . We use the same tools as were used in (Kubínová and Soodhalter, SIAM J. Matrix Anal. Appl. 41(2)464–486 2020), namely to analyze block Gmres as an iteration over a right vector space with scalars from the $$^*$$ -algebra of matrices. To facilitate our work, we also extend the work of Meurant and Tebbens and offer alternative proofs of some of their results, that can be more easily generalized to the block setting.

Numerical Algorithms
Trinity College Dublin (IE)
Reduced inequalities
Openalex Percentile: Top 5%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.