FLINT3.7.0-dev

acb_mat_approx_lu, acb_mat_approx_solve_lu_precomp

Synopsis#include <flint/acb_mat.h>
int acb_mat_approx_lu(slong * P, acb_mat_t LU, const acb_mat_t A, slong prec)source
void acb_mat_approx_solve_lu_precomp(acb_mat_t X, const slong * perm, const acb_mat_t A, const acb_mat_t B, slong prec)source

Compute an approximate LU decomposition PA=LUPA = LU with partial pivoting, in the layout of gr_mat_lu, returning zero if AA does not have full rank in the floating-point arithmetic (an exactly zero pivot column is encountered), in which case P and LU are meaningless; and solve with such a decomposition (assumed to come from acb_mat_approx_lu; NaN if a diagonal entry of UU is zero).

Cite this page

The FLINT team, “acb_mat_approx_lu, acb_mat_approx_solve_lu_precomp (acb_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/acb_mat/acb_mat_approx_lu.html (generated 2026-11-20).