Search Java Classes and Packages
Search Java Frameworks and Libraries
#Com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd Classes and Interfaces - 7 results found.
| Name | Description | Type | Package | Framework |
| BidiagonalSVDbyMR3 | Given a bidiagonal matrix A, computes the singular value decomposition (SVD) of A, using "Algorithm of Multiple Relatively Robust Representations" (MRRR). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd.mr3 | SuanShu |
|
| GolubKahanSVD | Golub-Kahan algorithm does the SVD decomposition of a tall matrix in two stages. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd | SuanShu |
|
| SVD | SVD decomposition decomposes a matrix A of dimension m x n, where m >= n, U' * A * V = D, or U * D * V' = A. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd | SuanShu |
|
| SVD .Method | Golub-Kahan, for higher precision. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd | SuanShu |
|
| SVDbyMR3 | Given a matrix A, computes its singular value decomposition (SVD), using "Algorithm of Multiple Relatively Robust Representations" (MRRR). | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd.mr3 | SuanShu |
|
| SVDDecomposition | 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. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd | SuanShu |
|
| SymmetricSVD | This algorithm calculates the Singular Value Decomposition (SVD) of a square, symmetric matrix A using QR algorithm. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.svd | SuanShu |
|
