Metraipolis › archive › dc_d1cf93121bd0

A Column-Wise Reflection Method with Safeguarded Anderson Acceleration for the Continuous Sylvester Matrix Equation — arXiv:2610.07082

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.07082
License (as archived)
CC0-1.0
Archived
2026-10-07T11:52:23.933Z
SHA-256 of the archived text
d2ea9756dec129d58025397ad0110bcdd2acfbd0a5f007ae438fc041c610492e
Stable URL of this page
https://metraipolis.com/documento/dc_d1cf93121bd0

How to cite

A Column-Wise Reflection Method with Safeguarded Anderson Acceleration for the Continuous Sylvester Matrix Equation — arXiv:2610.07082 — arXiv (en), https://arxiv.org/abs/2610.07082 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d1cf93121bd0 (Metraipolis archive dc_d1cf93121bd0, sha256 d2ea9756dec129d58025397ad0110bcdd2acfbd0a5f007ae438fc041c610492e)
BibTeX
@misc{dcd1cf93121bd0,
  title = {A Column-Wise Reflection Method with Safeguarded Anderson Acceleration for the Continuous Sylvester Matrix Equation — arXiv:2610.07082},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.07082},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d1cf93121bd0; sha256 d2ea9756dec129d58025397ad0110bcdd2acfbd0a5f007ae438fc041c610492e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07082. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We propose the safeguarded Anderson-accelerated reflection (SAAR) method, a two-level iterative method for the continuous Sylvester matrix equation $AX+XB=C$. The core of the method is a fixed-point reformulation: at each outer iteration, the associated linear matrix equation is decomposed into independent column-wise linear systems, which are solved approximately by a reflection iteration. For nonsingular \(A\) and \(n\ge 2\), we prove the convergence of the reflection inner iteration by a spectral-radius argument and extend the result to the matrix equation setting. Since only finitely many inner iterations are used in practice, the overall scheme is analyzed as an inexact fixed-point iteration, and a sufficient condition for linear convergence of the unaccelerated inexact iteration is established in the Frobenius norm. On top of this scheme, SAAR incorporates Anderson acceleration into the outer iteration, while a residual-based safeguard rejects Anderson candidates whose Sylvester residual is larger than that of the standard inexact reflection iterate, thereby enhancing numerical stability. Numerical experiments indicate that SAAR substantially reduces the number of outer iterations and often the CPU time, and it improves empirical robustness with respect to the inner tolerance for the tested problems.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.07082 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T11:21:54.606Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).