Condition Number¶
Quantify the worst local amplification of admissible relative input perturbations into relative output changes for a specified mathematical problem, point, and choice of norms.
Core Idea¶
A condition number is a numerical-analysis measure of how strongly a mathematical problem amplifies small changes in its data. The problem is represented by a solution map that sends admissible input data to an answer. At a specified input, one compares the size of a small perturbation of the data with the resulting change in the answer, then takes a local worst case over permitted perturbation directions. A relative condition number compares relative changes; an absolute condition number compares absolute changes. John Rice's general theory made the problem-and-data formulation explicit and separated the sensitivity of the mathematical task from the behavior of any particular implementation.
Scope of Application¶
Condition numbers are literal wherever a mathematical answer depends on uncertain or finite-precision input and the local amplification can be specified independently of an algorithm.
- Linear systems. Bounding sensitivity of a solution to changes in a matrix or right-hand side.
- Least squares. Distinguishing residual, solution, normwise, and componentwise sensitivity.
- Eigenvalue problems. Measuring how eigenvalues or invariant subspaces respond to perturbations.
- Polynomial roots. Explaining why nearby coefficients can produce widely displaced roots.
- Function evaluation. Using derivatives and scaling to assess local relative sensitivity.
- Optimization. Measuring sensitivity of solutions or values under a declared regularity regime.
- Geometric numerical problems. Defining condition relative to distance from ill-posed instances.
- Scientific computing. Combining data uncertainty, condition estimation, and backward-error analysis.
Clarity¶
State the solution map, base point, perturbed data, admissible perturbation set, input and output norms, and whether the quantity is absolute or relative. Write the limiting supremum or the theorem that reduces it to a derivative or operator norm. If the output can vanish, explain how relative scaling is handled. For matrices, name the norm and whether A, b, or both vary. Distinguish the exact condition number from an estimate.
Manages Complexity¶
The abstraction compresses infinitely many nearby problem instances into one local amplification scale. That scale lets analysts decide whether observed error is explained by the problem itself, by the algorithm, or by both. It guides precision selection, data-quality requirements, preconditioning, and reformulation. The compression discards direction-specific behavior, finite-perturbation nonlinearities, probability structure, and correlations among data errors. A single scalar may therefore be pessimistic, and structured or componentwise condition numbers can be much more informative than an unstructured normwise value.
Abstract Reasoning¶
- Specify the mathematical solution map rather than naming only a matrix or algorithm. 2. Fix the data point and identify which components are uncertain. 3. Choose admissible perturbations that preserve any relevant structure. 4. Choose input and output size rules and declare absolute or relative scaling. 5. Form the ratio of output change to input change. 6. Take a local limit and worst case over allowed directions.
Knowledge Transfer¶
The strict parent is Perturbation. A condition number begins with a reference instance, applies a small admissible disturbance, observes response, and extracts the leading local amplification. Perturbation applies to physical, statistical, and dynamical systems without producing a condition number. Condition Number adds a solution map, paired size measures, a limiting worst-direction ratio, and the numerical-analysis distinction between problem conditioning and algorithm stability. Sensitivity Analysis in Operations Research is a close surface but its accepted identity is post-optimality analysis of solved optimization models, so it is not the literal parent of a general numerical condition number.
Relationships to Other Abstractions¶
Current abstraction Condition Number Domain-specific
Parents (1) — more general patterns this builds on
-
Condition Number is a kind of Perturbation Prime
Perturbation is the strict parent by composition: a condition number presupposes a specified small departure from a reference input and evaluates the leading response.
Hierarchy paths (2) — routes to 2 parentless roots
- Condition Number → Perturbation → Observability
- Condition Number → Perturbation → State and State Transition → Phase Space
Neighborhood in Abstraction Space¶
Condition Number sits in a sparse region of the domain-specific corpus (85th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.
Family — Unclustered & Miscellaneous (1565 abstractions)
Nearest neighbors
- Directional Derivative — 0.81
- Well-posed problem — 0.81
- Neuman–Sándor Mean — 0.80
- Error analysis (mathematics) — 0.80
- Gauss–Newton Algorithm — 0.79
Computed from structural-signature embeddings · 2026-09-08