On the Danilewski method for computing the characteristic polynomial
Eldon Hansen
Abstract
Open-access reader
Eldon Hansen
Abstract
Open-access reader
The Danilewski method, as commonly applied, tends to be a very unstable method for finding the characteristic polynomial of a matrix. In this paper we show that, by an appropriate computational procedure, the method seems, in general, to be relatively stable. For the examples tried, it has yielded the characteristic polynomial with high accuracy.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The Danilewski method, as commonly applied, tends to be a very unstable method for finding the characteristic polynomial of a matrix. In this paper we show that, by an appropriate computational procedure, the method seems, in general, to be relatively stable. For the examples tried, it has yielded the characteristic polynomial with high accuracy.
Key concepts: Matrix polynomial, Polynomial, Characteristic polynomial, Polynomial matrix, Computer science, Wilkinson's polynomial, Stable polynomial, Computational complexity theory