LA BUDDE'S METHOD FOR COMPUTING CHARACTERISTIC POLYNOMIALS

La Budde's method computes the characteristic polynomial of a real matrix A in two stages: first it applies orthogonal similarity transformations to reduce A to upper Hessenberg form H, and second it computes the characteristic polynomial of H from characteristic polynomials of leading principal submatrices of H. If A is symmetric, then H is symmetric tridiagonal, and La Budde's method simplifies to the Sturm sequence method. If A is diagonal then La Budde's method reduces to the Summation Algorithm, a Horner-like scheme used by the MATLAB function poly to compute characteristic polynomials from eigenvalues. We present recursions to compute the individual coefficientsof the characteristic polynomial in the second stage of La Budde's method, and derive running error bounds for symmetric and nonsymmetric matrices. We also show that La Budde's method can be more accurate than poly, especially for indefinite and nonsymmetric matrices A. Unlike poly, La Budde's method is not affected by illconditioning of eigenvalues, requires only real arithmetic, and allows the computation of individual coefficients.

[1]  L. Csanky,et al.  Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..

[2]  Mordechai Lewin,et al.  On the coefficients of the characteristic polynomial of a matrix , 1994, Discret. Math..

[3]  G. Helmberg,et al.  On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors , 1993 .

[4]  Erich Kaltofen,et al.  On Wiedemann's Method of Solving Sparse Linear Systems , 1991, AAECC.

[5]  Mark Giesbrecht,et al.  Nearly Optimal Algorithms for Canonical Matrix Forms , 1995, SIAM J. Comput..

[6]  P. Samuelson.  A Method of Determining Explicitly the Coefficients of the Characteristic Equation , 1942 .

[7]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[8]  Wallace Givens,et al.  The Characteristic Value-Vector Problem , 1957, JACM.

[9]  Paul Horst,et al.  A Method for Determining the Coefficients of a Characteristic Equation , 1935 .

[10]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[11]  Chi-Tsong Chen,et al.  On the computation of the characteristic polynomial of a matrix , 1982 .

[12]  Gene H. Golub,et al.  Matrix computations , 1983 .

[13]  C. Papaconstantinou.  Construction of the characteristic polynomial of a matrix , 1974 .

[14]  W. Givens.  Numerical Computation of the Characteristic Values of a Real Symmetric Matrix , 1954 .

[15]  S. Barnett,et al.  Leverrier's algorithm: a new proof and extensions , 1989 .

[16]  Mei Han An,et al.  accuracy and stability of numerical algorithms , 1991 .

[17]  Alston S. Householder,et al.  The Theory of Matrices in Numerical Analysis , 1964 .

[18]  Ilse C. F. Ipsen,et al.  Perturbation Bounds for Determinants and Characteristic Polynomials , 2008, SIAM J. Matrix Anal. Appl..

[19]  Friedrich L. Bauer,et al.  On certain methods for expanding the characteristic polynomial , 1959, Numerische Mathematik.

[20]  Eldon R. Hansen,et al.  On the Danilewski Method , 1963, JACM.

[21]  V. Faddeeva,et al.  Computational methods of linear algebra: : chapter 1, basic material from linear algebra , 1952 .

[22]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[23]  M. Bingham.  A New Method for Obtaining the Inverse Matrix , 1941 .

[24]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[25]  D. Faddeev,et al.  Computational methods of linear algebra , 1981 .

[26]  Sven Hammarling,et al.  Latent Roots and Latent Vectors , 1970 .

[27]  Ilse C. F. Ipsen,et al.  Numerical computation of the characteristic polynomial of a complex matrix , 2010 .

[28]  P. Misra,et al.  Numerically reliable computation of characteristic polynomials , 1995, Proceedings of 1995 American Control Conference - ACC'95.

[29]  Ilse C. F. Ipsen,et al.  Computing Characteristic Polynomials from Eigenvalues , 2011, SIAM J. Matrix Anal. Appl..

[30]  Dean Lee,et al.  Neutron matter on the lattice with pionless effective field theory , 2004, nucl-th/0412002.

[31]  Shui-Hung Hou,et al.  Classroom Note: A Simple Proof of the Leverrier-Faddeev Characteristic Polynomial Algorithm , 1998, SIAM Rev..