An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
arXiv:math/9804133 · doi:10.1006/jcph.1998.5909
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.
8 pages, no figures, to appear in J. Comp. phys
Cited by in corpus (4)
- A quantum Monte-Carlo method for fermions, free of discretization errors
- Finite Temperature Auxiliary Field Quantum Monte Carlo in the Canonical Ensemble
- Thermodynamical properties of a mean-field plus pairing model and applications for the Fe nuclei
- Sampling Electronic Fock States using Determinant Quantum Monte Carlo