arXiv (All)
open access
A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm
Symmetric and unitary matrices are among the most important classes of structured matrices admitting efficient and stable eigenvalue algorithms. Notable examples include structure-preserving variants of the QR algorithm and their square-root-free counterparts. For unitary matrices, these algorithms
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
- Stable and effective restarting of the SS--RR and SS--RRR methods for computing partial eigenpairs of Hermitian matrices#1325565
- MPX: A Unified Systolic Array for Matrix and Polynomial Multiplication#280109
- Quantum-Inspired Algorithms beyond Unitary Circuits: the Laplace Transform#927218
- Quantum matrix arithmetics with Hamiltonian evolution#821411
- The QR factorization of a banded-plus-semiseparable matrix is computable in linear complexity with Householder reflections#665811
Record · ID 1249652
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