_arb_mat_ldl_inplace, _arb_mat_ldl_golub_and_van_loan, arb_mat_ldl
Synopsis
#include <flint/arb_mat.h>Compute the decomposition A = LDL^T with L unit lower triangular and D diagonal, stored in res: the strict lower triangle holds L and the diagonal holds D. Return nonzero if all entries of D are certainly positive, which proves that A is positive definite, and zero otherwise. The underscore versions work in place and leave the strict upper triangle undefined; the default uses Algorithm 4.1.2 of [GVL1996] (_arb_mat_ldl_golub_and_van_loan).
Guides#
References#
- [GVL1996] G. H. Golub and C. F. Van Loan, Matrix Computations, third edition, Johns Hopkins University Press (1996).
Cite this page
The FLINT team, “_arb_mat_ldl_inplace, _arb_mat_ldl_golub_and_van_loan, arb_mat_ldl (arb_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb_mat/_arb_mat_ldl_inplace.html (generated 2026-10-20).
@misc{flint-doc-arb-mat-arb-mat-ldl-inplace,
author = {{The FLINT team}},
title = {{\_arb\_mat\_ldl\_inplace, \_arb\_mat\_ldl\_golub\_and\_van\_loan, arb\_mat\_ldl (arb\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/arb_mat/_arb_mat_ldl_inplace.html},
note = {Generated 2026-10-20}
}