Crates.io | modcholesky |
lib.rs | modcholesky |
version | 0.2.0 |
source | src |
created_at | 2018-12-19 10:53:03.512431 |
updated_at | 2024-08-31 14:19:36.258425 |
description | Modified Cholesky decompositions |
homepage | http://argmin-rs.org |
repository | https://github.com/argmin-rs/modcholesky |
max_upload_size | |
id | 102710 |
size | 75,195 |
Given a symmetric matrix A which is potentially not positive definite, a modified Cholesky algorithm obtains the Cholesky decomposition LL^T
of the positive definite matrix P(A + E)P^T
where E
is symmetric and >= 0
, P
is a permutation matrix and L
is lower triangular.
If A
is already positive definite, then E = 0
.
The perturbation E
should be as small as possible for A + E
to be "sufficiently positive definite".
This is used in optimization methods where indefinite Hessians can be problematic.
This crate implements the algorithms by Gill, Murray and Wright (GMW81) and Schnabel and Eskow (SE90 and SE99).
All algorithms are currently based on ndarray
but will also be implemented for nalgebra
in the future.
Add this to your Cargo.toml
:
[dependencies]
modcholesky = "0.1.3"
Licensed under either of
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.