ott.math.decomposition.SparseCholeskySolver
ott.math.decomposition.SparseCholeskySolver#
- class ott.math.decomposition.SparseCholeskySolver(A, beta=0.0, key=None, **kwargs)[source]#
Sparse Cholesky solver using
jax.experimental.host_callback.call().Uses the CHOLMOD [Chen et al., 2008] bindings from
sksparse.cholmod.- Parameters
A (
TypeVar(T)) – Symmetric positive definite matrix of shape[n, n].beta (
float) – Decompose \(A + \beta * I\) instead of \(A\).key (
Optional[Hashable]) – Key used to cachesksparse.cholmod.Factor. This key must be unique toAto achieve correct results. If None, usehash()of this object.kwargs (
Any) – Keyword arguments forsksparse.cholmod.cholesky().
Methods
Clear the
sksparse.cholmod.Factorcache.create(A, **kwargs)Instantiate sparse or dense Cholesky solver.
solve(b)Solve the linear system \(A * x = b\).
Attributes
Symmetric positive definite matrix of shape
[n, n].Compute the lower-triangular factor of
Aand cache the result.