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

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

1998-04-28

arxiv.org/abs/math/9804133v1

J. Comp. Phys. {\bf 140}, 453-458 (1998).

Mathematics

Numerical Analysis

8 pages, no figures, to appear in J. Comp. phys

Scientific paper

10.1006/jcph.1998.5909

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.

Affiliated with

Also associated with

No associations

Rating

An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-680282