Noncommuting blocks in complex symmetric systems: spectral enclosures and polynomial acceleration

Abstract We analyze a relaxed block preconditioner for complex symmetric linear systems without imposing commutativity on the coefficient blocks. An explicit counterexample motivates a revised spectral analysis and demonstrates the limitations of real-spectrum conclusions in the noncommuting setting. A representation involving symmetric Cayley transforms yields corrected spectral enclosures, while commutator estimates describe how noncommutativity affects the numerical range. These estimates are used to establish convergence bounds for the generalized minimal residual method applied to the full preconditioned block system, including the contribution of block coupling. The resulting framework supports disk and Chebyshev polynomial acceleration and provides practical rules for selecting preconditioning parameters. We also derive perturbation guarantees for fixed inexact block solves, relating the accuracy of the inner computations to the resulting convergence estimates. Numerical experiments on dense and sparse test problems examine the spectral enclosures and polynomial bounds and compare the computational work required by different polynomial degrees. The results quantify the tradeoff between fewer outer Krylov iterations and additional pre-conditioner applications, providing guidance for choosing polynomial degrees and assessing the computational benefits of polynomial acceleration. MSC 2020: 65F08, 65F10, 65F15.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-17
DOI
https://doi.org/10.21203/rs.3.rs-11579546/v1
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Noncommuting blocks in complex symmetric systems: spectral enclosures and polynomial acceleration

Raghia El Hanine
Research Square
Matrix Theory and Algorithms
preprint

Noncommuting blocks in complex symmetric systems: spectral enclosures and polynomial acceleration

Raghia El Hanine
preprint en

Abstract

Abstract We analyze a relaxed block preconditioner for complex symmetric linear systems without imposing commutativity on the coefficient blocks. An explicit counterexample motivates a revised spectral analysis and demonstrates the limitations of real-spectrum conclusions in the noncommuting setting. A representation involving symmetric Cayley transforms yields corrected spectral enclosures, while commutator estimates describe how noncommutativity affects the numerical range. These estimates are used to establish convergence bounds for the generalized minimal residual method applied to the full preconditioned block system, including the contribution of block coupling. The resulting framework supports disk and Chebyshev polynomial acceleration and provides practical rules for selecting preconditioning parameters. We also derive perturbation guarantees for fixed inexact block solves, relating the accuracy of the inner computations to the resulting convergence estimates. Numerical experiments on dense and sparse test problems examine the spectral enclosures and polynomial bounds and compare the computational work required by different polynomial degrees. The results quantify the tradeoff between fewer outer Krylov iterations and additional pre-conditioner applications, providing guidance for choosing polynomial degrees and assessing the computational benefits of polynomial acceleration. MSC 2020: 65F08, 65F10, 65F15.

Research Square
Cadi Ayyad University (MA)
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.

Laika access coming soon