The Componentwise Distance to the Nearest Singular Matrix
From MaRDI portal
Recommendations
Cited in
(34)- Smoothing splines estimators for functional linear regression
- Smoothing splines estimators in functional linear regression with errors-in-variables
- Structured perturbations and symmetric matrices
- The sign-real spectral radius and cycle products
- 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
- Theorems of Perron-Frobenius type for matrices without sign restrictions
- Bounds for the distance between nearby Jordan and Kronecker structures in a closure hierachy
- The complex structured singular value
- Perron-Frobenius theory for complex matrices
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix
- Checking robust nonsingularity of tridiagonal matrices in linear time
- Almost commuting matrices with respect to the rank metric
- Testing for high-dimensional network parameters in auto-regressive models
- Molecular conformation search by distance matrix perturbations
- On the block-structured distance to non-surjectivity of sublinear mappings
- The maximum row length nonsingularity radius
- Generalized eigenvalue for even order tensors via Einstein product and its applications in multilinear control systems
- Structured singular value approach for systems with parametric uncertainty
- Bounds for the Componentwise Distance to the Nearest Singular Matrix
- scientific article; zbMATH DE number 4179999 (Why is no real title available?)
- Almost Sharp Bounds for the Componentwise Distance to the Nearest Singular Matrix
- scientific article; zbMATH DE number 1543276 (Why is no real title available?)
- Regularity radius: properties, approximation and a not a priori exponential algorithm
- Computations in the neighbourhood of algebraic singularities
- When Bifidelity Meets CoKriging: An Efficient Physics-Informed MultiFidelity Method
- A survey of computational complexity results in systems and control
- The structured distance to singularity of a symmetric tridiagonal Toeplitz matrix
- Structured singular value of a repeated complex full-block uncertainty
- Conic systems and sublinear mappings: equivalent approaches.
- On the computation of structured singular values and pseudospectra
- A gain-based lower bound algorithm for real and mixed problems
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)