Module amd 

approximate minimum degree ordering.

Structs

Control

tuning parameters for the amd implementation

FlopCount

flop count of the ldlt and lu factorizations if the provided ordering is used

Functions

order

computes the approximate minimum degree ordering for reducing the fill-in during the sparse cholesky factorization of a matrix with the sparsity pattern of $A + A^\top$

order_maybe_unsorted

computes the approximate minimum degree ordering for reducing the fill-in during the sparse cholesky factorization of a matrix with the sparsity pattern of $A + A^\top$

order_maybe_unsorted_scratch

computes the size and alignment of required workspace for computing the amd ordering of an unsorted matrix

order_scratch

computes the size and alignment of required workspace for computing the amd ordering of a sorted matrix