v1.12.3

CliqueTrees v1.12.3

Diff since v1.12.2

Non-Breaking Changes:

• Fix bug in function separatorwidth.

Closed issues:

• Obtain nonzero indices (a la findnz) from ::SymbFact? (#13)

v1.12.2

CliqueTrees v1.12.2

Diff since v1.12.1

Non-Breaking Changes:

• Re-implement elimination algorithms MinimalChordal and SafeSeparators.

v1.12.1

CliqueTrees v1.12.1

Diff since v1.12.0

Non-Breaking Changes:

• Fix bug in elimination algorithm ND.

v1.12.0

CliqueTrees v1.12.0

Diff since v1.11.1

Non-Breaking Changes:

• Re-implemented elimination algorithm MF.
• Various improvements to elimination algorithm ND.
• Implemented LDLt factorization.

v1.11.1

CliqueTrees v1.11.1

Diff since v1.11.0

Non-Breaking Changes:

• Fixed namespace-related bug in Julia 1.13+ (@yuyichao).
• The method linsolve!(::AbstractVector, ::CholFact, ::Val{true}) now allocates a workspace of the correct size.

Merged pull requests:

• Use Base version of ispositive/isnegative on 1.13 (#12) (@yuyichao)

v1.11.0

CliqueTrees v1.11.0

Diff since v1.10.0

Non-Breaking Changes:

• Added elimination algorithm Compression.

v1.10.0

CliqueTrees v1.10.0

Diff since v1.9.2

Non-Breaking Changes:

• Added a feature: Cholesky factorization and linear solve using pre-allocated workspaces.
• Improved performance of Cholesky factorization and linear solve.

v1.9.2

CliqueTrees v1.9.2

Diff since v1.9.1

Non-Breaking Changes:

• Performance improvements to function cholesky. Also, got it working with complex matrices.

v1.9.1

CliqueTrees v1.9.1

Diff since v1.9.0

Non-Breaking Changes:

• Significantly reduced memory use of function cholesky.

Closed issues:

• Performance of pure-julia BLAS in Cholesky (#11)

v1.9.0

CliqueTrees v1.9.0

Diff since v1.8.0

Non-Breaking Changes:

• Implemented sparse Cholesky factorization algorithm.