An accurate and efficient algorithm for the computation of the   characteristic polynomial of a general square matrix
  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. 
S. Rombouts and K. Heyde