Back to Sparse Direct Solver (SuperLU)
slu.analysis.getEliminationTree
Compute the elimination tree for a sparse matrix.
Syntax
slu.analysis.getEliminationTree(A, columnPermutation?)
Description
Compute the elimination tree for a sparse matrix. The elimination tree describes the structure of the LU factorization. Node i is the parent of node j if the first off-diagonal nonzero in column j of L is in row i. The tree structure determines: - Dependencies between columns during factorization - Potential for parallelism - Fill-in pattern
Parameters
| Name | Description |
|---|---|
| A | - Sparse matrix in CSC format |
| columnPermutation(optional) | - Optional column permutation |
Returns
EliminationTreeResult