Metraipolis › archive › dc_0f88fbfd4535

Conditioning of solutions to the Sylvester equation — arXiv:2609.04050

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.04050
License (as archived)
CC0-1.0
Archived
2026-10-17T02:33:11.160Z
SHA-256 of the archived text
5a703c8ed3fd993200fb04642c1de4b46374c28bbbbe60813b0a456a339f43a7
Stable URL of this page
https://metraipolis.com/documento/dc_0f88fbfd4535

How to cite

Conditioning of solutions to the Sylvester equation — arXiv:2609.04050 — arXiv (en), https://arxiv.org/abs/2609.04050 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0f88fbfd4535 (Metraipolis archive dc_0f88fbfd4535, sha256 5a703c8ed3fd993200fb04642c1de4b46374c28bbbbe60813b0a456a339f43a7)
BibTeX
@misc{dc0f88fbfd4535,
  title = {Conditioning of solutions to the Sylvester equation — arXiv:2609.04050},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.04050},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0f88fbfd4535; sha256 5a703c8ed3fd993200fb04642c1de4b46374c28bbbbe60813b0a456a339f43a7},
  year = {2026}
}

Archived text

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

We partially answer an open problem, posed by Nick Higham, concerning the conditioning of solutions to Sylvester and Lyapunov equations. The question arises in the backward stability analysis of numerical algorithms for these equations. We first show that the solution to the Sylvester equation $AX-XB = C$ can be arbitrarily ill-conditioned even if $A, B, C$ and the Kronecker sum $I \otimes A - B^T \otimes I$ are all perfectly conditioned. We then derive general a priori bounds on the condition number of the solution, as well as bounds for the Sylvester equation when $A$ and $B$ are diagonalizable. We also provide lower bounds involving matrix exponentials and Zolotarev numbers. For the Lyapunov equation $AX+XA^T = -C$, we obtain upper bounds in two settings: (i) when $A$ is symmetric positive definite while $C$ is symmetric negative definite, and (ii) when $A$ is strictly dissipative and $C$ is symmetric positive definite.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.04050 — 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-17T02:09:02.074Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).