2025/03/21 by Cade Ballew, Ballew, Cade, Thomas Trogdon +3 · 1 citation
Computer Science · Mathematics · #33C47 #42C05 #65F45 #65F60 #65R20 #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical Methods and Algorithms #Statistical and numerical algorithms
paper · pdf · doi:10.48550/arxiv.2503.17496
openalex publication_date 2025/03/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Two inverse-free iterative methods are developed for solving Sylvester matrix equations when the spectra of the coefficient matrices are on, or near, known disjoint subintervals of the real axis. Both methods use the recently-introduced Akhiezer iteration: one to address an equivalent problem of approximating the matrix sign function applied to a block matrix and the other to directly approximate the inverse of the Sylvester operator. In each case this results in provable and computable geometric rates of convergence. When the right-hand side matrix is low rank, both methods require only low-rank matrix-matrix products. Relative to existing approaches, the methods presented here can be more efficient and require less storage when the coefficient matrices are dense or otherwise costly to invert. Applications include solving partial differential equations and computing Fréchet derivatives.