arXiv (All)
open access
A Modified Direct Eigenvalue Swapping Algorithm with Guaranteed Stability
For a given matrix \( A \) in the real Schur form, the eigenvalue swapping algorithm is used to swap two adjacent diagonal blocks. In LAPACK, this operation is performed by the subroutine~\texttt{SLAEXC}/\texttt{DLAEXC}, which is based on a direct swapping algorithm proposed by Bai and Demmel in 199
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 single-precision floating-point systolic Givens-QRD Triangular Solver for MVDR Beamforming#925500
- On the Real Part of Butterfly Factorizations, with Application to Fast Transforms#1215681
- Twisted and intermediate eigenvalue problems in shape optimisation#208691
- Chronological stability for nonstationary matrix refinement#1083468
- The Stability of Block Eliminations and Additive Modifications#1036575
Record · ID 1423586
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