The following pages link to (Q4269334):
Displaying 12 items.
- Computing the nearest polynomial with a zero in a given domain by using piecewise rational functions (Q651875) (← links)
- Identical pseudospectra of any geometric multiplicity (Q765177) (← links)
- Universality and optimality in the information-disturbance tradeoff (Q1712562) (← links)
- On sensitivity of eigenvalues and eigendecompositions of matrices (Q1763838) (← links)
- Structured pseudospectra and structured sensitivity of eigenvalues (Q2433769) (← links)
- Spectral conditioning and pseudospectral growth (Q2642284) (← links)
- Image completion and blind deconvolution: model and algorithm (Q2666018) (← links)
- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval (Q3597978) (← links)
- Structured Eigenvalue Problems (Q3603885) (← links)
- Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations (Q4598332) (← links)
- Nearest Matrix Polynomials With a Specified Elementary Divisor (Q5146619) (← links)
- Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa (Q5358298) (← links)
