Uses of Interface
dev.nm.algebra.linear.matrix.doubles.factorization.triangle.LUDecomposition
-
Packages that use LUDecomposition Package Description dev.nm.algebra.linear.matrix.doubles.factorization.gaussianelimination dev.nm.algebra.linear.matrix.doubles.factorization.triangle -
-
Uses of LUDecomposition in dev.nm.algebra.linear.matrix.doubles.factorization.gaussianelimination
Classes in dev.nm.algebra.linear.matrix.doubles.factorization.gaussianelimination that implement LUDecomposition Modifier and Type Class Description class
GaussianElimination4SquareMatrix
This is a wrapper forGaussianElimination
but applies only to square matrices. -
Uses of LUDecomposition in dev.nm.algebra.linear.matrix.doubles.factorization.triangle
Classes in dev.nm.algebra.linear.matrix.doubles.factorization.triangle that implement LUDecomposition Modifier and Type Class Description class
Doolittle
Doolittle algorithm is a LU decomposition algorithm which decomposes a square matrix A into: 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, such that PA = LU.class
LU
LU decomposition decomposes an n x n matrix A so that P * A = L * U.
-