_arb_mat_cholesky_banachiewicz, arb_mat_cho
Synopsis
#include <flint/arb_mat.h>Compute the Cholesky decomposition with lower triangular, by the Cholesky–Banachiewicz algorithm. Return nonzero if all pivots are certainly positive, which proves that every symmetric matrix represented by the lower triangle of is positive definite; return zero if is not positive definite or the precision is insufficient. The underscore version works in place and leaves the strict upper triangle undefined.
Guides#
Cite this page
The FLINT team, “_arb_mat_cholesky_banachiewicz, arb_mat_cho (arb_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/arb_mat/_arb_mat_cholesky_banachiewicz.html (generated 2026-11-02).
@misc{flint-doc-arb-mat-arb-mat-cholesky-banachiewicz,
author = {{The FLINT team}},
title = {{\_arb\_mat\_cholesky\_banachiewicz, arb\_mat\_cho (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_cholesky_banachiewicz.html},
note = {Generated 2026-11-02}
}