Condition Number Calculator
Solve condition number problems step-by-step with our free calculator. See formulas, worked examples, and clear explanations.
Calculator
Adjust values & calculateFormula
The condition number is the product of the matrix norm and its inverse norm. For the 2-norm, it equals the ratio of the largest to smallest singular values. A condition number near 1 indicates stability, while a large value indicates the system is sensitive to perturbations.
Last reviewed: December 2025
Worked Examples
Example 1: Well-Conditioned Matrix
Example 2: Ill-Conditioned Matrix
Background & Theory
The Condition Number Calculator applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Condition Number Calculator traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
Formula
cond(A) = ||A|| * ||A^(-1)|| or cond_2(A) = sigma_max / sigma_min
The condition number is the product of the matrix norm and its inverse norm. For the 2-norm, it equals the ratio of the largest to smallest singular values. A condition number near 1 indicates stability, while a large value indicates the system is sensitive to perturbations.
Worked Examples
Example 1: Well-Conditioned Matrix
Problem: Find the condition number of A = [[1, 0], [0, 1]] (identity matrix).
Solution: The identity matrix has singular values sigma1 = 1, sigma2 = 1.\nCondition number (2-norm) = sigma1/sigma2 = 1/1 = 1.\nThe inverse is also the identity, so all norms give condition number = 1.\nThis is the best possible conditioning.
Result: Condition number = 1 (perfectly conditioned)
Example 2: Ill-Conditioned Matrix
Problem: Find the condition number of A = [[1, 2], [3, 4]].
Solution: Determinant = 1(4) - 2(3) = -2\nInverse = [[-2, 1], [1.5, -0.5]]\nFrobenius norm of A = sqrt(1+4+9+16) = sqrt(30)\nFrobenius norm of inverse = sqrt(4+1+2.25+0.25) = sqrt(7.5)\nCondition (Frobenius) = sqrt(30) * sqrt(7.5) = sqrt(225) = 15\n2-norm condition = sigma_max/sigma_min = 5.465/0.366 = 14.933
Result: Condition number (2-norm) = 14.93 | Well-conditioned
Frequently Asked Questions
What is the condition number of a matrix?
The condition number of a matrix measures how sensitive the solution of a linear system Ax = b is to small changes in A or b. It is defined as the product of the norm of A and the norm of its inverse. A condition number close to 1 means the matrix is well-conditioned and the solution is stable. A large condition number means the matrix is ill-conditioned and even tiny perturbations in the input can cause large changes in the output. The condition number is always greater than or equal to 1, and it equals 1 only for orthogonal matrices (in the 2-norm).
How is the condition number calculated?
The condition number depends on the matrix norm chosen. For the 2-norm, it is the ratio of the largest to smallest singular values of the matrix. For the Frobenius norm, it equals the product of the Frobenius norms of the matrix and its inverse. For the 1-norm, it uses maximum absolute column sums, and for the infinity-norm, maximum absolute row sums. The 2-norm condition number is most commonly used because it has a direct geometric interpretation in terms of how much the matrix stretches or compresses vectors. Each norm gives a slightly different condition number, but they all convey similar information about sensitivity.
What does a high condition number mean?
A high condition number indicates that the matrix is ill-conditioned, meaning that the solution to Ax = b is highly sensitive to perturbations. In floating-point arithmetic, you can expect to lose roughly log10(condition number) digits of accuracy in the computed solution. For example, if the condition number is 10^6 and you use double precision (about 16 significant digits), the solution may only be accurate to about 10 digits. In practical applications, a condition number above 10^12 or so means the computed solution may be completely unreliable. High condition numbers arise when the matrix is close to being singular.
What is the difference between the condition number and the determinant?
While both relate to matrix invertibility, they measure different things. The determinant tells you whether a matrix is singular (zero determinant) or not, but a nonzero determinant does not guarantee good conditioning. A matrix can have a large determinant and still be ill-conditioned, or a small determinant and be well-conditioned. The condition number provides a quantitative measure of how close the matrix is to being singular in a meaningful numerical sense. For numerical computation, the condition number is far more informative than the determinant about the reliability of solving linear systems.
How does the condition number affect numerical computations?
In numerical linear algebra, the condition number is critical for understanding the accuracy of computed solutions. When solving Ax = b using floating-point arithmetic, the relative error in the solution x is bounded by the condition number times the relative error in the input data. This means that for a condition number of 1000, a 0.001% error in the input could produce up to a 1% error in the output. Iterative solvers may converge slowly for ill-conditioned systems. Preconditioning techniques are specifically designed to reduce the effective condition number and improve both accuracy and convergence speed.
What are singular values and how do they relate to the condition number?
Singular values are the square roots of the eigenvalues of A-transpose times A, and they represent the stretching factors of the matrix transformation along orthogonal directions. Every matrix has a singular value decomposition (SVD), and the singular values are always non-negative real numbers. The largest singular value measures the maximum stretching, and the smallest measures the minimum. The 2-norm condition number is simply the ratio of the largest to the smallest singular value. When the smallest singular value is close to zero, the condition number is large, indicating near-singularity and numerical instability.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy