Sufficient Conditions for Regularity and Singularity of Interval Matrices
From MaRDI portal
Publication:4243514
DOI10.1137/S0895479896310743zbMath0924.15003OpenAlexW2091781639MaRDI QIDQ4243514
Publication date: 18 May 1999
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479896310743
Theory of matrix inversion and generalized inverses (15A09) Interval and finite arithmetic (65G30) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (23)
Characteristic polynomial assignment for plants with semialgebraic uncertainty: A robust diophantine equation approach ⋮ Real eigenvalue bounds of standard and generalized real interval eigenvalue problems ⋮ On Relation Between P-Matrices and Regularity of Interval Matrices ⋮ Interval Linear Algebra and Computational Complexity ⋮ Inverse of a fuzzy matrix of fuzzy numbers ⋮ Enclosures for the solution set of parametric interval linear systems ⋮ Interval linear systems: the state of the art ⋮ The optimal solution set of the interval linear programming problems ⋮ An updated two-step method for solving interval linear programming: A case study of the air quality management problem ⋮ Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets ⋮ A filtering method for the interval eigenvalue problem ⋮ An algorithm for addressing the real interval eigenvalue problem ⋮ Inexact Newton-type method for solving large-scale absolute value equation \(Ax-|x|=b\). ⋮ A note on regularity and positive definiteness of interval matrices ⋮ How to determine basis stability in interval linear programming ⋮ Computing the spectral decomposition of interval matrices and a study on interval matrix powers ⋮ Linear interval parametric approach to testing pseudoconvexity ⋮ A quadratically convergent descent method for the absolute value equation \(Ax + B |x| = b\) ⋮ A note on the unique solution of linear complementarity problem ⋮ An improved three-step method for solving the interval linear programming problems ⋮ Global and finite convergence of a generalized Newton method for absolute value equations ⋮ Monte Carlo simulation for computing the worst value of the objective function in the interval linear programming ⋮ Unnamed Item
Uses Software
This page was built for publication: Sufficient Conditions for Regularity and Singularity of Interval Matrices
