Skip to content

Latest commit

 

History

History
27 lines (17 loc) · 1.36 KB

README.md

File metadata and controls

27 lines (17 loc) · 1.36 KB

LADEL

Quasidefinite sparse LDL factorization package with rank 1 updates and (symmetric) row/column additions and deletes.

LADEL is now maintained at kul-optec/LADEL

View the original README

Documentation

The documentation for LADEL can be found online.

License

LADEL is licensed under LGPL v3.0. This library relies on the following external module:

  • AMD, licensed under BSD 3, Copyright (c), 1996-2015, Timothy A. Davis, Patrick R. Amestoy, and Iain S. Duff, see (Amestoy et al., 2004).

LADEL contains an implementation of several sparse matrix routines outlined in (Davis, 2006), separate from the reference implementation in CSparse, licensed under LGPL v2.1.

References

  • Amestoy, Patrick R., Timothy A. Davis, and Iain S. Duff. "Algorithm 837: AMD, an approximate minimum degree ordering algorithm." ACM Transactions on Mathematical Software (TOMS) 30.3 (2004): 381-388.

  • Davis, Timothy A. Direct Methods for Sparse Linear Systems. Philadelphia: SIAM, 2006. Print. Fundamentals and Algorithms.