Skip to content

Commit 2653055

Browse files
committed
Update documentation.
1 parent 99137bc commit 2653055

File tree

2 files changed

+14
-0
lines changed

2 files changed

+14
-0
lines changed

docs/src/solvers/solvers.md

Lines changed: 10 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -177,6 +177,16 @@ UMFPACKFactorization
177177
SparspakFactorization
178178
```
179179

180+
### CliqueTrees.jl
181+
182+
!!! note
183+
184+
Using this solver requires adding the package CliqueTrees.jl, i.e. `using CliqueTrees`
185+
186+
```@docs
187+
CliqueTreesFactorization
188+
```
189+
180190
### Krylov.jl
181191

182192
```@docs

src/factorization.jl

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1166,6 +1166,10 @@ end
11661166
snd = CliqueTrees.DEFAULT_SUPERNODE_TYPE,
11671167
reuse_symbolic = true,
11681168
)
1169+
1170+
The sparse Cholesky factorization algorithm implemented in CliqueTrees.jl.
1171+
The implementation is pure-Julia and accepts arbitrary numeric types. It is
1172+
somewhat slower than CHOLMOD.
11691173
"""
11701174
struct CliqueTreesFactorization{A, S} <: AbstractSparseFactorization
11711175
alg::A

0 commit comments

Comments
 (0)