Efficient incomplete Cholesky on rank-deficient matrices, todo: constrained Cholesky. More...
Go to the source code of this file.
Namespaces | |
gtsam | |
traits | |
Functions | |
pair< size_t, bool > | gtsam::choleskyCareful (Matrix &ATA, int order) |
bool | gtsam::choleskyPartial (Matrix &ABC, size_t nFrontal, size_t topleft) |
static int | gtsam::choleskyStep (Matrix &ATA, size_t k, size_t order) |
Variables | |
static const double | gtsam::negativePivotThreshold = -1e-1 |
static const int | gtsam::underconstrainedExponentDifference = 12 |
static const double | gtsam::underconstrainedPrior = 1e-5 |
static const double | gtsam::zeroPivotThreshold = 1e-6 |
Efficient incomplete Cholesky on rank-deficient matrices, todo: constrained Cholesky.
Definition in file base/cholesky.cpp.