Module extendr_api::prelude::sparse::linalg::amd

Expand description

Approximate minimum degree ordering.

Structs§

  • Tuning parameters for the AMD implementation.
  • Flop count of the LDLT and LU factorizations if the provided ordering is used.

Functions§

  • 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.T.
  • 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.T.
  • Computes the size and alignment of required workspace for computing the AMD ordering of an unsorted matrix.
  • Computes the size and alignment of required workspace for computing the AMD ordering of a sorted matrix.