Metraipolis › archive › dc_cb89d43a251e
Arnoldi iteration — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Arnoldi_iteration
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:29:56.323Z
- SHA-256 of the archived text
a3322d9f87386f26d1bcfd0fcd47e030822dd5febf23ec0c46ad87d14741cd83- Stable URL of this page
https://metraipolis.com/documento/dc_cb89d43a251e
How to cite
Arnoldi iteration — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Arnoldi_iteration (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cb89d43a251e (Metraipolis archive dc_cb89d43a251e, sha256 a3322d9f87386f26d1bcfd0fcd47e030822dd5febf23ec0c46ad87d14741cd83)
BibTeX
@misc{dccb89d43a251e,
title = {Arnoldi iteration — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Arnoldi_iteration},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cb89d43a251e; sha256 a3322d9f87386f26d1bcfd0fcd47e030822dd5febf23ec0c46ad87d14741cd83},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Arnoldi_iteration. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of an iterative method. Arnoldi finds an approximation to the eigenvalues and eigenvectors of general (possibly non-Hermitian) matrices by constructing an orthonormal basis of the Krylov subspace, which makes it particularly useful when dealing with large sparse matrices. The Arnoldi method belongs to a class of linear algebra algorithms that give a partial result after a small number of iterations, in contrast to so-called direct methods which must complete to give any useful results (see for example, Householder transformation). The partial result in this case being the first few vectors of the basis the algorithm is building. When applied to Hermitian matrices it reduces to the Lanczos algorithm. The Arnoldi iteration was invented by W. E. Arnoldi in 1951. Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «linear algebra»). Fonte: Wikipedia in inglese, voce «Arnoldi iteration» — https://en.wikipedia.org/wiki/Arnoldi_iteration Wikidata Q696822 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q696822 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Arnoldi_iteration?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1371583310, consultata il 2026-10-07T23:08:58.858Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 281c51bb06f761b90d7abda364d47e89a4f6c610903fe541a6584fc509445aa9