LU decomposition using the crout algorithm
JavaScript
11
2
Other
This project provides an implementation of the Crout algorithm for LU decomposition of matrices using the ndarray library. It allows users to decompose a matrix into lower (L) and upper (U) triangular matrices, either separately or combined in a single matrix to save space. This tool is designed for developers working with numerical computations in JavaScript, particularly those who need efficient matrix factorization for applications like solving linear systems or performing matrix inversions.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies
Support the repos that depend on this repository
Top contributors
mikolalysenko
2 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet
