# Module extendr_api::prelude::sparse::linalg::cholesky::simplicial

## Expand description

Simplicial factorization module.

A simplicial factorization is one that processes the elements of the Cholesky factor of the input matrix single elements, rather than by blocks. This is more efficient if the Cholesky factor is very sparse.

## Structs§

- Reference to a slice containing the Cholesky factor’s elimination tree.
- Cholesky LDLT factors containing both the symbolic and numeric representations.
- Cholesky LLT factor containing both its symbolic and numeric representations.
- Cholesky factor structure containing its symbolic structure.

## Functions§

- Computes the numeric values of the Cholesky LDLT factors of the matrix
`A`

, and stores them in`L_values`

. - Returns the size and alignment of the workspace required to compute the numeric Cholesky LDLT factorization of a matrix
`A`

with dimension`n`

. - Computes the row indices and numeric values of the Cholesky LDLT factor of the matrix
`A`

, and stores them in`L_row_indices`

and`L_values`

. - Computes the numeric values of the Cholesky LLT factor of the matrix
`A`

, and stores them in`L_values`

. - Returns the size and alignment of the workspace required to compute the numeric Cholesky LLT factorization of a matrix
`A`

with dimension`n`

. - Computes the row indices and numeric values of the Cholesky LLT factor of the matrix
`A`

, and stores them in`L_row_indices`

and`L_values`

. - Computes the symbolic structure of the Cholesky factor of the matrix
`A`

. - Computes the size and alignment of the workspace required to compute the symbolic Cholesky factorization of a square matrix with size
`n`

. - Computes the elimination tree and column counts of the Cholesky factorization of the matrix
`A`

. - Computes the size and alignment of the workspace required to compute the elimination tree and column counts of a matrix of size
`n`

with`nnz`

non-zero entries.