RECURSIVE ALGORITHM FOR DETERMINING EIGENVALUES OF A QUINDIAGONAL MATRIX

被引：10

作者：

EVANS, DJ ^{[1
]}

机构：

[1] LOUGHBOROUGH UNIV TECHNOL,DEPT MATH,LOUGHBOROUGH LE11 3TU,LEICESTERSHIRE,ENGLAND

来源：

COMPUTER JOURNAL | 1975年 / 18卷 / 01期

关键词：

D O I：

10.1093/comjnl/18.1.70

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 R. A. Sweet (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 use of the well known bisection process.

引用

页码：70 / 73

页数：4