Checking robust nonsingularity of tridiagonal matrices in linear time
From MaRDI portal
Publication:1914863
DOI10.1007/BF01731979zbMath0848.65029MaRDI QIDQ1914863
Mauro Leoncini, Ilan Bar-On, Bruno Codenotti
Publication date: 9 June 1996
Published in: BIT (Search for Journal in Brave)
NP-hardlinear time algorithmrobust nonsingularitytridiagonal systemregularity checktridiagonal interval matrices
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Regularity radius: Properties, approximation and a not a priori exponential algorithm ⋮ Determinants of Interval Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On condition numbers and the distance to the nearest ill-posed problem
- Several NP-hard problems arising in robust stability analysis
- Reliable parallel solution of bidiagonal systems
- Checking robust nonsingularity is NP-hard
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Bounding the Error in Gaussian Eimination for Tridiagonal Systems
- Scaling for Numerical Stability in Gaussian Elimination
- The Componentwise Distance to the Nearest Singular Matrix
- Interval Methods for Systems of Equations
- Algorithm 694
- Computing Exact Componentwise Bounds on Solutions of Lineary Systems with Interval Data is NP-Hard
- Numerical Linear Algebra
This page was built for publication: Checking robust nonsingularity of tridiagonal matrices in linear time
