The generalized eigenvalue problem for tridiagonal symmetric interval matrices

An algorithm to compute the eigenintervals of the generalized eigenvalue problem for tridiagonal symmetric matrices (A,B) with interval entries is developed. The algorithm is based on the Sturm Sequences and requires twice as much computational effort as for point matrices. The algorithm is applied...

Full description

Saved in:
Bibliographic Details
Published in:International journal of control 1999-01, Vol.72 (6), p.531-535
Main Authors: EL-GEBEILY, M. A, ABU-BAKER, Y, ELGINDI, M. B
Format: Article
Language:English
Subjects:
Algebra
Exact sciences and technology
Linear and multilinear algebra, matrix theory
Mathematics
Sciences and techniques of general use
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An algorithm to compute the eigenintervals of the generalized eigenvalue problem for tridiagonal symmetric matrices (A,B) with interval entries is developed. The algorithm is based on the Sturm Sequences and requires twice as much computational effort as for point matrices. The algorithm is applied to the problem of computing the natural frequencies of a vibrating beam where the manufacturing tolerance is taken into consideration.
ISSN:0020-7179
1366-5820
DOI:10.1080/002071799220966