Search Java Classes and Packages
Search Java Frameworks and Libraries
#Com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle Classes and Interfaces - 10 results found.
| Name | Description | Type | Package | Framework |
| Chol | Cholesky decomposition decomposes a real, symmetric (hence square), and positive definite matrix A into A = L * Lt, where L is a lower triangular matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle.cholesky | SuanShu |
|
| Cholesky | Cholesky decomposition decomposes a real, symmetric (hence square), and positive definite matrix A into A = L * Lt, where L is a lower triangular matrix. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle.cholesky | SuanShu |
|
| CholeskyBanachiewicz | Cholesky decomposition decomposes a real, symmetric (hence square), and positive definite matrix A into A = L * Lt, where L is a lower triangular matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle.cholesky | SuanShu |
|
| CholeskyBanachiewiczParallelized | This is a parallelized version of CholeskyBanachiewicz. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle.cholesky | SuanShu |
|
| CholeskySparse | Cholesky decomposition decomposes a real, symmetric (hence square), and positive definite matrix A into A = L * Lt, where L is a lower triangular matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle.cholesky | SuanShu |
|
| CholeskyWang2006 | Cholesky decomposition works only for a positive definite matrix. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle.cholesky | SuanShu |
|
| Doolittle | Doolittle algorithm is a LU decomposition algorithm which decomposes a square matrix P is an n x n permutation matrix;L is an n x n (unit) lower triangular matrix;U is an n x n upper triangular matrix, | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle | SuanShu |
|
| LDLt | The LDL decomposition decomposes a real and symmetric (hence square) matrix A into A = L * D * Lt. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle | SuanShu |
|
| LU | LU decomposition decomposes an n x n matrix A so that P * A = L * U. | Class | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle | SuanShu |
|
| LUDecomposition | LU decomposition decomposes an n x n matrix A so that P * A = L * U. | Interface | com.numericalmethod.suanshu.algebra.linear.matrix.doubles.factorization.triangle | SuanShu |
|
