EIGENVALUES OF TRIDIAGONAL SYMMETRICAL INTERVAL MATRICES

被引:6
作者
COMMERCON, JC
机构
[1] Maitre de Conferences, Département Informatique, Institut National des Sciences Appliquées
关键词
D O I
10.1109/9.272338
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
An algorithm for the determination of the eigenvalues of tridiagonal symmetric interval matrices is presented. The intervals of the eigenvalues are not overestimated, but exactly calculated. The algorithm is an efficient one, because it only needs twice as many operations as the Sturm algorithm, which is used for real matrices.
引用
收藏
页码:377 / 379
页数:3
相关论文
共 12 条
[1]  
Beckenbach E. F., 1961, INEQUALITIES
[2]   INTERVALS OF P-MATRICES AND RELATED MATRICES [J].
BIALAS, S ;
GARLOFF, J .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1984, 58 (APR) :33-41
[3]  
COMMERCON JC, 1987, THESIS LYON
[4]  
Gregory R. T., 1969, COLLECTION MATRICES
[5]   THE EXTREME EIGENVALUES AND STABILITY OF REAL SYMMETRICAL INTERVAL MATRICES [J].
HERTZ, D .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1992, 37 (04) :532-535
[6]  
HOLLOT CV, 1987, 26TH P C DEC CONTR L, P794
[7]   SUFFICIENT CONDITIONS ON STABILITY OF INTERVAL MATRICES - CONNECTIONS AND NEW RESULTS [J].
JIE, C .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1992, 37 (04) :541-544
[8]   A ROOT DISTRIBUTION CRITERION FOR INTERVAL POLYNOMIALS [J].
KOKAME, H ;
MORI, T .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1991, 36 (03) :362-364
[9]  
PRESS SJ, 1972, APPLIED MULTIVARIATE
[10]  
Stoer J., 1993, INTRO NUMERICAL ANAL