A recursive algorithm for determining the eigenvalues of a quindiagonal matrix
Open Access
- 1 January 1975
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 18 (1) , 70-73
- https://doi.org/10.1093/comjnl/18.1.70
Abstract
A recursive algorithm for the implicit derivation of the determinant of a quindiagonal matrix is derived in terms of its leading principal minors. Its form is more compact and simpler than that previously presented in the literature by Sweed (1969). Its envisaged use is for deriving the eigenvalues of quindiagonal matrices by Newton's or similar root finding methods. The derived algorithm simplifies considerably for the case of symmetric matrices yielding a Sturmian sequence of polynomials from which the eigenvalues can be obtained by used of the well known bisection process.Keywords
This publication has 0 references indexed in Scilit: