Tight bounds on the radius of nonsingularity

DOI10.1007/978-3-319-31769-4_9MaRDI QIDQ2803591zbMATH OpenOpenAlexFDO

Authors David Hartman, Milan Hladík

Publication date 2 May 2016

Published in Scientific Computing, Computer Arithmetic, and Validated Numerics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 2.5 Generic

Full work available at URL https://doi.org/10.1007/978-3-319-31769-4_9

zbMATH Keywords

semidefinite programmingboundsradius of nonsingularity

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Regularity radius: properties, approximation and a not a priori exponential algorithm
• The maximum row length nonsingularity radius
• Probabilistic solutions to some NP-hard matrix problems
• Checking robust nonsingularity is NP-hard
• scientific article; zbMATH DE number 176451

Cites work

• Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix
• An algorithm for checking stability of symmetric interval matrices
• Approximation algorithms and semidefinite programming.
• Beyond singular values and loop shapes
• Bounds for the Componentwise Distance to the Nearest Singular Matrix
• Checking robust nonsingularity is NP-hard
• Computational complexity and feasibility of data processing and interval computations
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Interval Methods for Systems of Equations
• Introduction to Interval Analysis
• Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
• The complex structured singular value
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(11)

• Regularity radius: properties, approximation and a not a priori exponential algorithm
• The maximum row length nonsingularity radius
• Complexity of computing interval matrix powers for special classes of matrices.
• Computing the spectral decomposition of interval matrices and a study on interval matrix powers
• Interval Linear Algebra and Computational Complexity
• Maximization of a PSD quadratic form and factorization
• Radii of solvability and unsolvability of linear systems
• Tight bounds and conjectures for the isolation lemma
• What is the radius of singularity of a real matrix?
• Generalized eigenvalue problem for interval matrices
• Sufficient regularity conditions for complex interval matrices and approximations of eigenvalues sets

This page was built for publication: Tight bounds on the radius of nonsingularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803591)