Checking robust nonsingularity of tridiagonal matrices in linear time (Q1914863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Checking robust nonsingularity of tridiagonal matrices in linear time |
scientific article; zbMATH DE number 885549
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Checking robust nonsingularity of tridiagonal matrices in linear time |
scientific article; zbMATH DE number 885549 |
Statements
Checking robust nonsingularity of tridiagonal matrices in linear time (English)
0 references
9 June 1996
0 references
It is known that the problem of checking regularity (i.e., robust nonsingularity) of interval matrices is NP-hard [cf. \textit{S. Poljak} and \textit{J. Rohn}, Math. Control Signals Syst. 6, No. 1, 1-9 (1993; Zbl 0780.93027)]. In the present paper it is proved that for tridiagonal interval matrices regularity check can be performed by a linear time algorithm.
0 references
robust nonsingularity
0 references
tridiagonal system
0 references
linear time algorithm
0 references
NP-hard
0 references
tridiagonal interval matrices
0 references
regularity check
0 references
0 references
