Matrix Condition Number
The condition number κ(A) = ||A||·||A⁻¹|| measures sensitivity to input errors. κ ≈ 1: well-conditioned; κ ≫ 1: ill-conditioned. Hilbert and Vandermonde matrices are famously ill-conditioned.
Did our AI summary help? Let us know.
Hilbert matrices: κ grows exponentially. κ ≈ 1 for orthogonal matrices. Singular: κ = ∞ (A⁻¹ undefined).
Ready to run the numbers?
Why: Condition numbers predict numerical stability in linear systems. Ill-conditioned matrices amplify rounding errors.
How: Compute ||A||_F and ||A⁻¹||_F (Frobenius norm). κ = ||A||·||A⁻¹||. Spectral (2-norm) κ uses singular values.
Run the calculator when you are ready.
Examples
For educational and informational purposes only. Verify with a qualified professional.
🧮 Fascinating Math Facts
κ(AB) ≤ κ(A)·κ(B)
Frobenius: ||A||_F = √(Σ aᵢⱼ²)
Key Takeaways
- • κ(A) = ||A||·||A⁻¹|| measures sensitivity of Ax=b to errors.
- • κ ≈ 1: well-conditioned. κ >> 1: ill-conditioned.
- • Lose up to log₁₀(κ) digits of accuracy in solution.
- • κ(I) = 1. Singular matrix: κ = ∞.
- • Hilbert and Vandermonde matrices are classically ill-conditioned.
Did You Know?
How It Works
1. Compute inverse
A⁻¹ exists iff det(A) ≠ 0. Use adjugate/determinant.
2. Compute norms
||A||_F and ||A⁻¹||_F (Frobenius norm).
3. Multiply
κ(A) = ||A||·||A⁻¹||.
4. Interpret
κ < 5: very good. κ > 1000: caution.
Expert Tips
Check before solving
Compute κ before solving Ax=b; high κ = unstable.
Scaling
Scale rows/columns to improve conditioning.
Regularization
Add λI: (A + λI)x = b for stability.
Higher precision
Use double/quad for ill-conditioned systems.
Comparison Table
| κ range | Assessment |
|---|---|
| κ < 5 | Very well-conditioned |
| 5 ≤ κ < 100 | Well-conditioned |
| 100 ≤ κ < 1000 | Mildly ill-conditioned |
| κ ≥ 1000 | Ill-conditioned |
FAQ
What is condition number?
κ(A) = ||A||·||A⁻¹||. Measures sensitivity of Ax=b to errors.
When is κ = ∞?
When A is singular (det = 0). No inverse.
What is κ for identity?
κ(I) = 1. Perfect conditioning.
What norm to use?
Frobenius is easy. Spectral (2-norm) is most common in theory.
Hilbert matrix?
Classically ill-conditioned. κ grows exponentially.
How to improve?
Scaling, preconditioning, regularization (A + λI).
Rectangular matrices?
Use pseudoinverse: κ = σ_max/σ_min.
Digits lost?
Up to log₁₀(κ) digits of accuracy lost.
Stats
Sources
- • Wilkinson, The Algebraic Eigenvalue Problem
- • Golub & Van Loan, Matrix Computations
- • Trefethen & Bau, Numerical Linear Algebra
- • Higham, Accuracy and Stability
- • Turing (1948), Rounding-off Errors
- • Demmel, Applied Numerical Linear Algebra
Related Calculators
Adjoint Matrix Calculator
Adjoint Matrix Calculator - Calculate and learn about linear-algebra concepts
MathematicsCofactor Matrix Calculator
Cofactor Matrix Calculator - Calculate and learn about linear-algebra concepts
MathematicsMatrix By Scalar Calculator
Matrix By Scalar Calculator - Calculate and learn about linear-algebra concepts
MathematicsMatrix Diagonalization Calculator
Matrix Diagonalization Calculator - Calculate and learn about linear-algebra concepts
MathematicsMatrix Inverse Calculator
Matrix Inverse Calculator - Calculate and learn about linear-algebra concepts
MathematicsMatrix Power Calculator
Matrix Power Calculator - Calculate and learn about linear-algebra concepts
Mathematics