On condition numbers and the distance to the nearest ill-posed problem
From MaRDI portal
Publication:1079333
DOI10.1007/BF01400115zbMath0597.65036MaRDI QIDQ1079333
Publication date: 1987
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133195
pole assignment; eigenvalues; zeros of polynomials; eigenvectors; condition number; ill-posed problem; matrix inversion
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
65K10: Numerical optimization and variational techniques
93B55: Pole and zero placement problems
65F35: Numerical computation of matrix norms, conditioning, scaling
65H05: Numerical computation of solutions to single equations
26C10: Real polynomials: location of zeros
65F05: Direct numerical methods for linear systems and matrix inversion
15A12: Conditioning of matrices
Related Items
Statistical Condition Estimation for Linear Systems, A condition number theorem for underdetermined polynomial systems, Computing multiple roots of inexact polynomials, The radius of metric regularity, THE METHOD OF SPLITTING OPERATORS AND LYAPUNOV MAJORANTS IN PERTURBATION LINEAR ALGEBRA AND CONTROL, Computations in the neighbourhood of algebraic singularities, Two-dimensional measures of reachability for linear time-invariant systems, Lower and upper bounds in the perturbation of general linear algebraic equations, Condition numbers of a nearly singular simple root of a polynomial, Condition number for the Drazin inverse and the Drazin-inverse solution of singular linear system with their condition numbers, Estimating the distance to uncontrollability: A fast method and a slow one, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, Condition number for the \(W\)-weighted Drazin inverse and its applications in the solution of rectangular linear system, Condition numbers with their condition numbers for the weighted Moore-Penrose inverse and the weighted least squares solution, Smoothed analysis of complex conic condition numbers, On the numerical condition of algebraic curves and surfaces. I: Implicit equations, The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue, Computing a nearest symmetric positive semidefinite matrix, Controllability and stability radii for companion form systems, Where is the nearest non-regular pencil?, Computing with barycentric polynomials, Numerical computation of an analytic singular value decomposition of a matrix valued function, On condition numbers of a nondefective multiple eigenvalue, Stability rates for linear ill-posed problems with compact and non-compact operators, Mysteries of mathematics and computation, Condition numbers and their condition numbers, Condition operators, condition numbers, and condition number theorem for the generalized eigenvalue problem, Polynomial root finding by means of continuation, Condition number of Bott-Duffin inverse and their condition numbers, A statistical analysis of the numerical condition of multiple roots of polynomials., Condition number related with \(W\)-weighted Drazin inverse and singular linear systems, On sensitivity of eigenvalues and eigendecompositions of matrices, On the sensitivity of the spectral projection, Computing eigenspaces with specified eigenvalues of a regular matrix pair \((A,B)\) and condition estimation: Theory, algorithms and software, Perturbation theory for homogeneous polynomial eigenvalue problems, Checking robust nonsingularity of tridiagonal matrices in linear time, On the complexity of solving feasible systems of linear inequalities specified with approximate data, Linear programming, complexity theory and elementary functional analysis, Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices, On level-2 condition number for the weighted Moore-Penrose inverse, Perturbation bounds for polynomials, Condition numbers for the outer inverse and constrained singular linear system, Perturbations and metric regularity, Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials, The Probability That a Numerical Analysis Problem is Difficult
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On neighbouring matrices with quadratic elementary divisors
- Computing stable eigendecompositions of matrices
- Properties of a matrix with a very ill-conditioned eigenproblem
- Note on matrices with a very ill-conditioned eigenproblem
- Robust pole assignment in linear state feedback
- The Condition Number of Equivalence Transformations That Block Diagonalize Matrix Pencils
- Error Bounds for Approximate Invariant Subspaces of Closed Linear Operators
- Numerical Linear Algebra
- A principal axis transformation for non-hermitian matrices
