Uses of Interface
dev.nm.algebra.linear.matrix.doubles.factorization.svd.SVDDecomposition
-
Packages that use SVDDecomposition Package Description dev.nm.algebra.linear.matrix.doubles.factorization.svd dev.nm.algebra.linear.matrix.doubles.factorization.svd.mr3 -
-
Uses of SVDDecomposition in dev.nm.algebra.linear.matrix.doubles.factorization.svd
Classes in dev.nm.algebra.linear.matrix.doubles.factorization.svd that implement SVDDecomposition Modifier and Type Class Description class
GolubKahanSVD
Golub-Kahan algorithm does the SVD decomposition of a tall matrix in two stages.class
SVD
SVD decomposition decomposes a matrix A of dimension m x n, where m >= n, such that U' * A * V = D, or U * D * V' = A.class
SymmetricSVD
This algorithm calculates the Singular Value Decomposition (SVD) of a square, symmetric matrix A using QR algorithm. -
Uses of SVDDecomposition in dev.nm.algebra.linear.matrix.doubles.factorization.svd.mr3
Classes in dev.nm.algebra.linear.matrix.doubles.factorization.svd.mr3 that implement SVDDecomposition Modifier and Type Class Description class
BidiagonalSVDbyMR3
Given a bidiagonal matrix A, computes the singular value decomposition (SVD) of A, using "Algorithm of Multiple Relatively Robust Representations" (MRRR).class
SVDbyMR3
Given a matrix A, computes its singular value decomposition (SVD), using "Algorithm of Multiple Relatively Robust Representations" (MRRR).
-