The Componentwise Distance to the Nearest Singular Matrix

DOI10.1137/0613003zbMath0749.65031OpenAlexW1966320607MaRDI QIDQ3988971

James W. 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

zbMATH Keywords

singular value decompositionconditioningmatrix normsdistance to singularitydistance to the closest singular matrixperfect relative perturbation bound

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Related Items (29)

The P-matrix problem is co-NP-complete ⋮ Helly-type theorems and generalized linear programming ⋮ Condition numbers and their condition numbers ⋮ Inversion error, condition number, and approximate inverses of uncertain matrices ⋮ The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix ⋮ Theorems of Perron-Frobenius type for matrices without sign restrictions ⋮ Checking robust nonsingularity of tridiagonal matrices in linear time ⋮ Computations in the neighbourhood of algebraic singularities ⋮ Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems ⋮ The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix ⋮ Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix ⋮ Structured singular value approach for systems with parametric uncertainty ⋮ A survey of computational complexity results in systems and control ⋮ On the computation of structured singular values and pseudospectra ⋮ Molecular conformation search by distance matrix perturbations ⋮ On the block-structured distance to non-surjectivity of sublinear mappings ⋮ Conic systems and sublinear mappings: equivalent approaches. ⋮ A gain-based lower bound algorithm for real and mixed \(\mu \) problems ⋮ Structured singular value of a repeated complex full-block uncertainty ⋮ Testing for high-dimensional network parameters in auto-regressive models ⋮ Smoothing splines estimators for functional linear regression ⋮ The complex structured singular value ⋮ When Bifidelity Meets CoKriging: An Efficient Physics-Informed MultiFidelity Method ⋮ Regularity radius: Properties, approximation and a not a priori exponential algorithm ⋮ Smoothing splines estimators in functional linear regression with errors-in-variables ⋮ The maximum row length nonsingularity radius ⋮ Structured perturbations and symmetric matrices ⋮ The sign-real spectral radius and cycle products ⋮ Perron-Frobenius theory for complex matrices

This page was built for publication: The Componentwise Distance to the Nearest Singular Matrix