An Algorithm for Checking Regularity of Interval Matrices
From MaRDI portal
Recommendations
Cited in
(24)- Interval matrices: regularity generates singularity
- On \(P\)-matrices
- Checking robust nonsingularity of tridiagonal matrices in linear time
- A heuristic rational algorithm for checking the congruence of normal matrices
- Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets
- Determining the positive definiteness margin of interval matrices
- Analysis and design of robust controllers using the interval Diophantine equation
- A theorem on regularity of interval matrices
- Extension of the Hansen-Bliek method to right-quantified linear systems
- Regularity radius and real eigenvalue range
- Principal Component Analysis for Non-Precise Data
- Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach
- Formally verified conditions for regularity of interval matrices
- Regularity radius: properties, approximation and a not a priori exponential algorithm
- scientific article; zbMATH DE number 2165169 (Why is no real title available?)
- scientific article; zbMATH DE number 2119673 (Why is no real title available?)
- A note on checking regularity of interval matrices
- scientific article; zbMATH DE number 903746 (Why is no real title available?)
- Inverse of a fuzzy matrix of fuzzy numbers
- On solving vague systems of linear equations with pattern-shaped columns
- An algorithm for addressing the real interval eigenvalue problem
- Principal minors. I: A method for computing all the principal minors of a matrix
- Solution of the fully fuzzy linear systems using the decomposition procedure
- Interval linear systems: the state of the art
This page was built for publication: An Algorithm for Checking Regularity of Interval Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243527)
