Title :
An asymptotically superior algorithm for computing the characteristic polynomial of a tridiagonal matrix
Author_Institution :
Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
fDate :
10/1/1988 12:00:00 AM
Abstract :
The author describes an algorithm for computing the characteristic polynomial of a tridiagonal matrix. It is quite general and consists in the application of the divide-and-conquer technique to the evaluation of a three-term recurrence relation. The algorithm developed requires O(n log2n) arithmetic operations as compared to the classical algorithm that requires O(n2 ) arithmetic operations
Keywords :
matrix algebra; polynomials; arithmetic operations; characteristic polynomial; divide-and-conquer technique; three-term recurrence relation; tridiagonal matrix; Arithmetic; Computational complexity; Mathematics; Military computing; Polynomials; Writing;
Journal_Title :
Proceedings of the IEEE
