arXiv Analytics

Sign in

arXiv:math/9804133 [math.NA]AbstractReferencesReviewsResources

An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix

S. Rombouts, K. Heyde

Published 1998-04-28Version 1

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.

Comments: 8 pages, no figures, to appear in J. Comp. phys
Journal: J. Comp. Phys. {\bf 140}, 453-458 (1998).
Categories: math.NA, cond-mat
Subjects: 65F30, 81-08
Related articles: Most relevant | Search more
arXiv:2406.06008 [math.NA] (Published 2024-06-10)
Efficient algorithm for the oscillatory matrix functions
arXiv:2101.09674 [math.NA] (Published 2021-01-24)
Efficient and accurate computation to the $\varphi$-function and its action on a vector
arXiv:2312.14483 [math.NA] (Published 2023-12-22)
On the accurate computation of the Newton form of the Lagrange interpolant