Package | Description |
---|---|
dev.nm.algebra.linear.matrix.doubles.factorization.svd | |
dev.nm.algebra.linear.matrix.doubles.factorization.svd.mr3 |
Modifier and Type | Class and 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.
|
Modifier and Type | Class and 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).
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.