Bidiagonal

E440653

Bidiagonal is a special kind of sparse matrix that has nonzero entries only on the main diagonal and either the superdiagonal or subdiagonal, making it efficient for numerical linear algebra computations.

All labels observed (2)

Label Occurrences
Bidiagonal canonical 1
Golub–Kahan bidiagonalization 1

How this entity was disambiguated

Statements (43)

Predicate Object
instanceOf Bidiagonal matrix ⓘ
Bidiagonal matrix ⓘ
Matrix type ⓘ
Sparse matrix ⓘ
belongsTo Linear algebra ⓘ
enables Fast matrix–vector multiplication ⓘ
Reduced storage requirements ⓘ
hasApplicationIn Computational physics ⓘ
Data analysis ⓘ
Numerical analysis ⓘ
Scientific computing ⓘ
hasComplexityForMatVec O(n) ⓘ
hasNonzeroEntriesOn Main diagonal ⓘ
Subdiagonal ⓘ
Superdiagonal ⓘ
Superdiagonal or subdiagonal ⓘ
hasProperty At most two nonzero diagonals ⓘ
Band matrix with bandwidth 1 ⓘ
Structured sparsity pattern ⓘ
hasStorageComplexity O(n) ⓘ
hasVariant Lower bidiagonal matrix ⓘ
Upper bidiagonal matrix ⓘ
isCharacterizedBy Nonzeros confined to two adjacent diagonals ⓘ
isContrastedWith Dense matrix ⓘ
Diagonal matrix ⓘ
Tridiagonal matrix ⓘ
isDefinedOver Real numbers or complex numbers ⓘ
isObtainedBy Bidiagonalization process ⓘ
isObtainedFrom General matrix ⓘ
isSpecialCaseOf Band matrix ⓘ
Sparse matrix ⓘ
Tridiagonal matrix ⓘ
isUsedFor Efficient matrix computations ⓘ
Eigenvalue algorithms ⓘ
Singular value decomposition ⓘ
isUsedIn Golub–Kahan SVD algorithm ⓘ
Iterative methods for linear systems ⓘ
Least squares computations ⓘ
Numerical linear algebra ⓘ
Orthogonal transformations ⓘ
QR algorithm ⓘ
isUsedWith Givens rotations ⓘ
Householder reflections ⓘ

How these facts were elicited

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

SparseArrays → definesType → Bidiagonal ⓘ
Jacobi matrix → usedIn → Golub–Kahan bidiagonalization ⓘ
linked to: Bidiagonal