Tight Bounds on the Radius of Nonsingularity
From MaRDI portal
Publication:2803591
DOI10.1007/978-3-319-31769-4_9zbMath1354.65081OpenAlexW2418949411MaRDI QIDQ2803591
Publication date: 2 May 2016
Published in: Scientific Computing, Computer Arithmetic, and Validated Numerics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-31769-4_9
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Radii of solvability and unsolvability of linear systems ⋮ Interval Linear Algebra and Computational Complexity ⋮ Generalized eigenvalue problem for interval matrices ⋮ Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets ⋮ Complexity of computing interval matrix powers for special classes of matrices. ⋮ Maximization of a PSD quadratic form and factorization ⋮ Computing the spectral decomposition of interval matrices and a study on interval matrix powers ⋮ Regularity radius: Properties, approximation and a not a priori exponential algorithm
Cites Work
- The ellipsoid method and its consequences in combinatorial optimization
- Computational complexity and feasibility of data processing and interval computations
- The complex structured singular value
- Checking robust nonsingularity is NP-hard
- Approximation Algorithms and Semidefinite Programming
- Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Introduction to Interval Analysis
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Beyond singular values and loop shapes
- Interval Methods for Systems of Equations
- Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- An algorithm for checking stability of symmetric interval matrices
This page was built for publication: Tight Bounds on the Radius of Nonsingularity
