gplu 0.1.0

Sparse LU factorization with partial pivoting
Documentation
  • Coverage
  • 45%
    9 out of 20 items documented0 out of 3 items with examples
  • Size
  • Source code size: 660.84 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 16.03 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 2m 20s Average build duration of successful builds.
  • all releases: 2m 20s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • rwl/gplu
    5 1 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • rwl

GPLU

LU Decomposition using Gilbert-Peierls method.

About

Crate gplu provides sparse LU factorization with partial pivoting as described in "Sparse Partial Pivoting in Time Proportional to Arithmetic Operations" by John R. Gilbert and Tim Peierls.

@article{Gilbert1988,
  doi = {10.1137/0909058},
  url = {https://doi.org/10.1137/0909058},
  year  = {1988},
  month = {sep},
  publisher = {Society for Industrial {\&} Applied Mathematics ({SIAM})},
  volume = {9},
  number = {5},
  pages = {862--874},
  author = {John R. Gilbert and Tim Peierls},
  title = {Sparse Partial Pivoting in Time Proportional to Arithmetic Operations},
  journal = {{SIAM} Journal on Scientific and Statistical Computing}
}

License

This source code is distributed, with the permission of John Gilbert and Tim Peierls, under the BSD 3-clause license (LICENSE or https://opensource.org/licenses/BSD-3-Clause).

This source code was translated from the original gp FORTRAN code into Rust by Richard W. Lincoln. The FORTRAN source was distributed in Sivan Toledo's work on incomplete-factorization, from PARC in the early 1990s, and can be found in the ILU package on Netlib:

http://www.netlib.org/linalg/ilu.tgz