I'm providing an convenience implementation for solving by LU Decomposition.
This method is more efficient than Gaussian Elimination. (See Cormen et. al Introduction to Algorithms 3rd ed.)
Thanks to the fine architecture of la4j, it also works for sparse matrices by polymorphism. However, more experiments might be need to verify efficiency with the sparse matrices.
I'm providing an convenience implementation for solving by LU Decomposition. This method is more efficient than Gaussian Elimination. (See Cormen et. al Introduction to Algorithms 3rd ed.)
Thanks to the fine architecture of la4j, it also works for sparse matrices by polymorphism. However, more experiments might be need to verify efficiency with the sparse matrices.