The generalized eigenvalue problem for tridiagonal symmetric interval matrices (Q4485223)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1457737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The generalized eigenvalue problem for tridiagonal symmetric interval matrices |
scientific article; zbMATH DE number 1457737 |
Statements
The generalized eigenvalue problem for tridiagonal symmetric interval matrices (English)
0 references
12 June 2000
0 references
generalized eigenvalue problem
0 references
tridiagonal symmetric interval matrices
0 references
Sturm sequences
0 references
interval arithmetic
0 references
algorithm
0 references
0.9458272
0 references
0.9428044
0 references
0.9369307
0 references
0.9263016
0 references
0.9239048
0 references
0 references
0.9143706
0 references
0.91374296
0 references
Let \(\mathbb A\) and \(\mathbb B\) be symmetric tridiagonal matrices with interval entries. All values \(\lambda\) are found such that there exist symmetric point matrices \(A\) and \(B\), \(A\in \mathbb A\), \(B\in \mathbb B\), \(B\) is a positive defined matrix, and a non-zero vector \(x\in R^n\) such that \(Ax = \lambda B x\). An algorithm solving this problem is given. The mentioned algorithm is based on Sturm sequences.
0 references