Golub–Kahan SVD algorithm
E1282495
UNEXPLORED
The Golub–Kahan SVD algorithm is a numerical method for computing the singular value decomposition of a matrix by first reducing it to bidiagonal form and then iteratively refining its singular values and vectors.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Golub–Kahan SVD algorithm canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T17676457 — 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: Golub–Kahan SVD algorithm Context triple: [Bidiagonal matrix, isUsedIn, Golub–Kahan SVD algorithm]
-
A.
Bartels–Stewart algorithm
The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
-
B.
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.
-
C.
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.
-
D.
SVD
SVD is the abbreviation for the Special Victims Division, a specialized police unit that investigates sensitive crimes such as sexual offenses and crimes against vulnerable victims.
-
E.
SVD
SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
- 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: Golub–Kahan SVD algorithm Target entity description: The Golub–Kahan SVD algorithm is a numerical method for computing the singular value decomposition of a matrix by first reducing it to bidiagonal form and then iteratively refining its singular values and vectors.
-
A.
Bartels–Stewart algorithm
The Bartels–Stewart algorithm is a numerical linear algebra method that efficiently solves certain matrix equations, particularly Sylvester and Lyapunov equations, using Schur decompositions.
-
B.
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.
-
C.
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.
-
D.
SVD
SVD is the abbreviation for the Special Victims Division, a specialized police unit that investigates sensitive crimes such as sexual offenses and crimes against vulnerable victims.
-
E.
SVD
SVD is the IATA airport code for Argyle International Airport, the main international gateway to Saint Vincent and the Grenadines in the Caribbean.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Bidiagonal