arXiv (All)
open access
Conditioning of solutions to the Sylvester equation
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-X
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Duality Reformulation of the Companion-Matrix Lyapunov Problem#1160722
- Weakly chained matrices, policy iteration, and impulse control#984767
- Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop#652195
- Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop#650742
- Last two pieces of the puzzle for unsolvability of a system of two quadratic (in)equalities#799761
Record · ID 926895
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive