An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
Numerical Analysis
2025-10-20 v1 Condensed Matter
Numerical Analysis
Abstract
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.
Keywords
Cite
@article{arxiv.math/9804133,
title = {An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix},
author = {S. Rombouts and K. Heyde},
journal= {arXiv preprint arXiv:math/9804133},
year = {2025}
}
Comments
8 pages, no figures, to appear in J. Comp. phys