## You are here

Homematrix condition number

## Primary tabs

# matrix condition number

# 1 Matrix Condition Number

The *condition number for matrix inversion* with respect to a matrix norm
$\lVert\cdot\rVert$ of a square matrix $A$ is defined by

$\kappa(A)=\|A\|\|A^{{-1}}\|\,,$ |

if $A$ is non-singular; and $\kappa(A)=+\infty$ if $A$ is singular.

The condition number is a measure of stability or sensitivity of a matrix (or the linear system it represents) to numerical operations. In other words, we may not be able to trust the results of computations on an ill-conditioned matrix.

Matrices with condition numbers near 1 are said to be *well-conditioned*. Matrices with condition numbers much greater than one (such as around $10^{5}$ for a $5\times 5$ Hilbert matrix) are said to be *ill-conditioned*.

If $\kappa(A)$ is the condition number of $A$, then $\kappa(A)$ measures a sort of inverse distance from $A$ to the set of singular matrices, normalized by $\lVert A\rVert$. Precisely, if $A$ is invertible, and $\lVert B-A\rVert<\lVert A^{{-1}}\rVert^{{-1}}$, then $B$ must also be invertible. On the other hand, in the case of the $2$-norm, there always exists a singular matrix $B$ such that $\lVert B-A\rVert_{2}=\lVert A^{{-1}}\rVert_{2}^{{-1}}$ (so the distance estimate is sharp).

# References

- 1
Golub and Van Loan.
*Matrix Computations*, 3rd edition. Johns Hopkins University Press, 1996.

## Mathematics Subject Classification

15A12*no label found*65F35

*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier