arXiv (All)
open access
Stable and effective restarting of the SS--RR and SS--RRR methods for computing partial eigenpairs of Hermitian matrices
We consider stable and effective restarts of the SS--RR and SS--RRR methods for computing the eigenpairs of a large Hermitian matrix $A\in\mathbb{C}^{n\times n}$ with the $n_{ev}$ eigenvalues in a given interval. Taking the CJ--SS--RR and CJ--SS--RRR methods for instance, we prove that the commonly
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 Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm#1249652
- Quantum diagonalization of Hermitean matrices#404871
- Matrix algebras with orthogonal Cauchy-like transforms and Toeplitz approximation: a negative result#1341609
- A subspace method for large-scale eigenvalue optimization#955300
- Quantum algorithms for the exponentiation of Toeplitz matrices and applications in partial differential equations#1106071
Record · ID 1325565
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