On the Danilewski Method
Open Access
- 1 January 1963
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 10 (1) , 102-109
- https://doi.org/10.1145/321150.321158
Abstract
In this paper we describe a computational procedure for the Danilewski method which employs a "search for pivots." It yields the characteristic poly- i: } nomiM much more accurately than the procedures reported by previous investigators. We shall then present a count of mathematical operations used in applying the method with multiple precision arithmetic. These operation counts emphasize the well-known fact that the method is quite fast. We then conclude that the } method should not be regarded as an uneconomical process for obtaining matrix eigenvalues.Keywords
This publication has 7 references indexed in Scilit:
- Error analysis of floating-point computationNumerische Mathematik, 1960
- Householder's Method for the Solution of the Algebraic EigenproblemThe Computer Journal, 1960
- The evaluation of the zeros of ill-conditioned polynomials. Part INumerische Mathematik, 1959
- On certain methods for expanding the characteristic polynomialNumerische Mathematik, 1959
- Stability of the Reduction of a Matrix to Almost Triangular and Triangular Forms by Elementary Similarity TransformationsJournal of the ACM, 1959
- Finding Zeros of Arbitrary FunctionsJournal of the ACM, 1958
- A Method for Solving Algebraic Equations Using an Automatic ComputerMathematical Tables and Other Aids to Computation, 1956