Arnoldi method
E1274346
UNEXPLORED
The Arnoldi method is an iterative numerical algorithm used to approximate a few eigenvalues and eigenvectors of large, sparse matrices by constructing an orthonormal basis of a Krylov subspace.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Arnoldi iteration | 1 |
| Arnoldi method canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T17520856 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Arnoldi method Context triple: [ARPACK, algorithmType, Arnoldi method]
-
A.
Richardson iteration
Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
-
B.
Lanczos algorithm
The Lanczos algorithm is an iterative numerical method used to approximate eigenvalues and eigenvectors of large sparse matrices, particularly in scientific computing and numerical linear algebra.
-
C.
Jacobi eigenvalue algorithm
The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
-
D.
Godunov's method
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
-
E.
Jacobi method
The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Arnoldi method Target entity description: The Arnoldi method is an iterative numerical algorithm used to approximate a few eigenvalues and eigenvectors of large, sparse matrices by constructing an orthonormal basis of a Krylov subspace.
-
A.
Richardson iteration
Richardson iteration is an early iterative method for solving linear systems and other operator equations, based on repeated relaxation steps to progressively improve an approximate solution.
-
B.
Lanczos algorithm
The Lanczos algorithm is an iterative numerical method used to approximate eigenvalues and eigenvectors of large sparse matrices, particularly in scientific computing and numerical linear algebra.
-
C.
Jacobi eigenvalue algorithm
The Jacobi eigenvalue algorithm is an iterative numerical method for computing all eigenvalues and eigenvectors of a real symmetric matrix by applying a sequence of orthogonal similarity transformations.
-
D.
Godunov's method
Godunov's method is a numerical scheme for solving hyperbolic partial differential equations that uses exact or approximate Riemann solvers to compute fluxes at cell interfaces in finite-volume discretizations.
-
E.
Jacobi method
The Jacobi method is an iterative numerical algorithm used to solve systems of linear equations by repeatedly updating each variable using values from the previous iteration.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
arpack
linked to: Arnoldi method