_gr_mat_charpoly_berkowitz, gr_mat_charpoly_berkowitz
Synopsis
#include <flint/gr_mat.h>The characteristic polynomial by Berkowitz's division-free algorithm [Ber1984], with O(n^4) ring operations (as O(n) matrix-vector products for each of n leading principal submatrices). Since it needs no divisions and no zero tests, it succeeds whenever the ring arithmetic does.
References#
- [Ber1984] S. J. Berkowitz, "On computing the determinant in small parallel time using a small number of processors", Information Processing Letters 18 (1984), 147-150
Cite this page
The FLINT team, “_gr_mat_charpoly_berkowitz, gr_mat_charpoly_berkowitz (gr_mat.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_mat/_gr_mat_charpoly_berkowitz.html (generated 2026-10-20).
@misc{flint-doc-gr-mat-gr-mat-charpoly-berkowitz,
author = {{The FLINT team}},
title = {{\_gr\_mat\_charpoly\_berkowitz, gr\_mat\_charpoly\_berkowitz (gr\_mat.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_mat/_gr_mat_charpoly_berkowitz.html},
note = {Generated 2026-10-20}
}