scientific article; zbMATH DE number 1355110
From MaRDI portal
Publication:4269334
Cited in
(12)- Universality and optimality in the information-disturbance tradeoff
- On sensitivity of eigenvalues and eigendecompositions of matrices
- Structured pseudospectra and structured sensitivity of eigenvalues
- Spectral conditioning and pseudospectral growth
- Image completion and blind deconvolution: model and algorithm
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval
- Structured Eigenvalue Problems
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- Nearest matrix polynomials with a specified elementary divisor
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions
- Identical pseudospectra of any geometric multiplicity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4269334)