arXiv (All)
open access
A simple stability analysis of the Lanczos algorithm in finite precision arithmetic
We give a self-contained analysis of the symmetric Lanczos algorithm without reorthogonalization when computations are performed inexactly. We show the computed Lanczos vectors are well-behaved locally. From this we (i) prove Paige's loss-of-orthogonality identity, and (ii) construct a Greenbaum-typ
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
- Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra#996996
- Lanczos with compression for symmetric eigenvalue problems#635753
- Lanczos with compression for symmetric eigenvalue problems#633404
- Algorithmic stability via ensembling#997311
- SLRAアルゴリズムによる多変数多項式の近似decomposition (Computer Algebra --Foundations and Applications)#442744
Record · ID 1389382
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