The Componentwise Distance to the Nearest Singular Matrix
DOI10.1137/0613003zbMATH Open0749.65031OpenAlexW1966320607MaRDI QIDQ3988971FDOQ3988971
Authors: James Demmel 
Publication date: 28 June 1992
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0613003
Recommendations
singular value decompositionconditioningmatrix normsdistance to singularitydistance to the closest singular matrixperfect relative perturbation bound
Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Cited In (33)
- Title not available (Why is that?)
- The maximum row length nonsingularity radius
- Bounds for the distance between nearby Jordan and Kronecker structures in a closure hierachy
- Conic systems and sublinear mappings: equivalent approaches.
- A gain-based lower bound algorithm for real and mixed \(\mu \) problems
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
- Theorems of Perron-Frobenius type for matrices without sign restrictions
- Condition numbers and their condition numbers
- Testing for high-dimensional network parameters in auto-regressive models
- Inversion error, condition number, and approximate inverses of uncertain matrices
- A survey of computational complexity results in systems and control
- Almost commuting matrices with respect to the rank metric
- Helly-type theorems and generalized linear programming
- Checking robust nonsingularity of tridiagonal matrices in linear time
- Structured perturbations and symmetric matrices
- The sign-real spectral radius and cycle products
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- Computations in the neighbourhood of algebraic singularities
- Smoothing splines estimators for functional linear regression
- Smoothing splines estimators in functional linear regression with errors-in-variables
- The P-matrix problem is co-NP-complete
- The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix
- Title not available (Why is that?)
- Perron-Frobenius theory for complex matrices
- The complex structured singular value
- On the computation of structured singular values and pseudospectra
- When Bifidelity Meets CoKriging: An Efficient Physics-Informed MultiFidelity Method
- Structured singular value of a repeated complex full-block uncertainty
- On the block-structured distance to non-surjectivity of sublinear mappings
- Molecular conformation search by distance matrix perturbations
- Structured singular value approach for systems with parametric uncertainty
- Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix
- Regularity radius: properties, approximation and a not a priori exponential algorithm
This page was built for publication: The Componentwise Distance to the Nearest Singular Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988971)
