Name | Description | Type | Package | Framework |
GramSchmidt | The Gram-Schmidt process is a method for orthogonalizing a set of vectors in an inner product space. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.qr | SuanShu |
HouseholderQR | Successive Householder reflections gradually transform a matrix A to the upper triangular For example, the first step is to multiply A with a Householder matrix | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.qr | SuanShu |
QR | QR decomposition of a matrix decomposes an m x n matrix A so that A = Q * R. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.qr | SuanShu |
QRDecomposition | QR decomposition of a matrix decomposes an m x n matrix A so that A = Q * R. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.qr | SuanShu |