Ill-Conditioned Matrices Are Componentwise Near to Singularity
نویسنده
چکیده
For a square matrix normed to 1, the normwise distance to singularity is well known to be equal to the reciprocal of the condition number. In this paper we give an elementary and selfcontained proof for the fact that an ill-conditioned matrix is also not far from a singular matrix in a componentwise sense. This is shown to be true for any weighting of the componentwise distance. In words: Ill-conditioned means for matrix inversion nearly ill-posed also in the componentwise sense.
منابع مشابه
Ill-conditionedness Needs Not Be Componentwise near to Ill-posedness for Least Squares Problems
The condition number of a problem measures the sensitivity of the answer to small changes in the input, where “small” refers to some distance measure. A problem is called illconditioned if the condition number is large, and it is called ill-posed if the condition number is infinity. It is known that for many problems the (normwise) distance to the nearest ill-posed problem is proportional to th...
متن کاملOn the Sensitivity of Solution Components in Linear Systems of Equations
Expressions are presented for the errors in individual components of the solution to systems of linear equations and linear least squares problems. No assumptions about the structure or distribution of the perturbations are made. The resulting "componentwise condition numbers" measure the sensitivity of each solution component to perturbations. It is shown that any linear system has at least on...
متن کاملOptimal Scaling for P -norms and Componentwise Distance to Singularity
In this note we give lower and upper bounds for the optimal p-norm condition number achievable by two-sided diagonal scalings. There are no assumptions on the irreducibility of certain matrices. The bounds are shown to be optimal for the 2-norm. For the 1-norm and inf-norm the (known) exact value of the optimal condition number is confirmed. We give means how to calculate the minimizing diagona...
متن کاملComputing the smallest eigenvalue of large ill-conditioned Hankel matrices
This paper presents a parallel algorithm for finding the smallest eigenvalue of a particular form of ill-conditioned Hankel matrix, which requires the use of extremely high precision arithmetic. Surprisingly, we find that commonly-used approaches that are designed for high efficiency are actually less efficient than a direct approach under these conditions. We then develop a parallel implementa...
متن کاملApplying Legendre Wavelet Method with Regularization for a Class of Singular Boundary Value Problems
In this paper Legendre wavelet bases have been used for finding approximate solutions to singular boundary value problems arising in physiology. When the number of basis functions are increased the algebraic system of equations would be ill-conditioned (because of the singularity), to overcome this for large $M$, we use some kind of Tikhonov regularization. Examples from applied sciences are pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 41 شماره
صفحات -
تاریخ انتشار 1999