Approximation¶

Version: v2 · 2026-08-30 · History · 1 correction
Prime #: 10
Domain group: Formal Sciences
Origin domain: Mathematics
Also from: Physics, Engineering & Design (beyond software)
Related primes: Abstraction

Core Idea¶

Representing a complex entity with a simpler, "good-enough" model.

How would you explain it like I'm…

Good-Enough Answer

If someone asks how many jellybeans are in a big jar, you don't count every one. You guess close, like "about 200," because that's good enough. An approximation is a good-enough answer you use because the perfect one is too hard to figure out.

Close-enough stand-in

An approximation is when you swap a hard, exact thing for a simpler version that's close enough. Pi is really 3.14159..., but in class you use 3.14 because the extra digits don't matter for your problem. The important rule is that you know how far off your answer might be, and you know your task can handle that much error. If you don't track the error, you're not approximating; you're just guessing and hoping.

Tractable surrogate with known error

Approximation is the deliberate trade of an exact, intractable target for a simpler surrogate you can actually compute with, in exchange for a bounded and known error. Every real approximation specifies four things: the exact object being stood in for, the simpler surrogate used in its place, an error measure relating the two, and the tolerance the use case can absorb. A weather forecaster's model isn't the real atmosphere, but it's good enough to predict tomorrow's rain. The discipline lives or dies on whether you can name the error. Calculus, polynomial approximation, and numerical methods all formalized this idea historically.

Approximation is the deliberate substitution of a tractable surrogate for an intractable target, accepting a bounded and known error in exchange for the ability to compute, reason, or act. Every approximation specifies four elements: the exact object being stood in for, the simpler surrogate used in its place, an error measure relating the two, and the tolerance the use case can absorb. The decisive commitment is that the error is controlled and named — by a strict bound, an asymptotic estimate, or a probabilistic guarantee — and that the purpose can demonstrably absorb it. Historically the discipline was formalized through calculus (Newton's infinitesimal method), Chebyshev's polynomial approximation theory (1854), and Weierstrass's density theorem (1885). Without a named error and a named tolerance, what remains is not approximation but guessing dressed in technical vocabulary.

Broad Use¶

Central to decision-making under uncertainty, numerical simulations, and pragmatic reasoning.

Clarity¶

Provides "good enough" models to navigate uncertainty, e.g., Newtonian mechanics for everyday physics.

Manages Complexity¶

Uses simpler representations that are "good enough," saving time and effort.

Abstract Reasoning¶

Promotes pragmatic reasoning by balancing precision and efficiency.

Knowledge Transfer¶

Foundational in simulation, engineering tolerances, and heuristic problem-solving.

Example¶

Engineers approximate π as 3.14 in calculations where higher precision isn't critical.

Relationships to Other Abstractions¶

Current abstraction Approximation Prime

Parents (1) — outgoing typed relations

Approximation is a decomposition of Representation Prime

Approximation is the specific shape representation takes when the medium deliberately differs from the target by a bounded, named error.

Children (104) — abstractions linked here by typed relations

Absorbing boundary condition Domain-specific is a kind of Approximation

It remains its own entry because its identity is fixed by the wave equation and finite computational domain, artificial boundary and outward normal, outgoing and incoming wave decomposition, local differential nonlocal Dirichlet-to-Neumann or absorbing-layer formulation, frequency angle and mode assumptions, reflection coefficient, order of approximation, discretization stability and corner treatment, validation against enlarged domain and distinction from physical absorbing medium.
Alpha max plus beta min algorithm Domain-specific is a kind of Approximation

What makes it its own entry: the domain-specific identity determined by the approximation has the declared max-min form and coefficient choice is reported with its worst-case or average error criterion.
Approximate Bayesian Computation Domain-specific is a kind of, typical Approximation

ABC approximates an intractable Bayesian posterior with simulated-data acceptance in place of an unavailable likelihood.
Approximation Algorithm Domain-specific is a kind of Approximation

prime:approximation is the broader abstraction this entry instantiates: the algorithm returns a controlled good-enough result rather than exact optimum.
Asymptotic analysis Domain-specific is a kind of Approximation

The discipline builds controlled limit-dependent approximations.

▸ Show 99 more

Beam Propagation Method Domain-specific is a kind of Approximation
**Approximation** is the strict parent by specialization.
Bézier surface Domain-specific is a kind of Approximation
The candidate literally instantiates prime:approximation; its computer_aided_geometric_design restrictions provide the residual.
Boole's rule Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by nodes are five equally spaced points spanning four subintervals, weights and step convention match the formula, and smoothness and remainder assumptions support the claimed order.
Born–Mayer equation Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by ionic charges, Madelung constant, nearest-neighbor separation, repulsion parameter, sign convention, and per-mole energy convention are declared under the ionic-crystal assumptions.
Classical XY model Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the lattice and dimension, site angle variables, interaction graph and couplings, Hamiltonian and sign, external field, boundary conditions, temperature and ensemble, observables, vortex definition and phase-transition claims.
Colombeau algebra Domain-specific is a kind of Approximation
What makes it its own entry: A differential algebra of generalized functions that embeds distributions while permitting nonlinear multiplication and retaining compatibility with smooth-function products.
Davies equation Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the solvent and temperature, electrolyte species and charges, concentration scale, ionic-strength definition, mean versus single-ion activity coefficient, logarithm base, constants and fitted term, valid range, reference state, unit convention and comparison with Debye–Hückel and Pitzer models.
Development (topology) Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the topological space X, countable open covers F_n, star of a point relative to a cover, neighborhood-base or closed-set separation condition, quantifiers over points neighborhoods and closed sets, nested development option, developable-space definition, Moore-space relation and separation or metrizability hypotheses.
Diamond principle Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the sequence has the declared domain and for every target subset the set of correct initial-segment guesses is stationary.
Differential of a function Domain-specific is a kind of Approximation
The differential is the first-order local approximation to change in a function.
Directional Derivative Domain-specific is a kind of Approximation
**Approximation** is the strict available parent because a directional derivative is the coefficient of the first-order local approximation along a chosen path.
Discrete dipole approximation Domain-specific is a kind of Approximation
What makes it its own entry: A numerical electromagnetic-scattering method that replaces a target by interacting polarizable points and solves their self-consistent response to an incident field.
Discrete ordinates method Domain-specific is a kind of Approximation
Discrete ordinates method instantiates Approximation because it replaces a continuous angular transport field and integral with a finite weighted representation whose error can be refined and diagnosed.
Dynamical mean-field theory Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the lattice Hamiltonian and local interactions, noninteracting density of states, locality approximation, impurity action and hybridization function, impurity solver, lattice and local Green functions, Dyson equations, self-consistency map, convergence criterion and observables and error limits.
Effective Mass (Solid-State Physics) Domain-specific is a kind of Approximation
**Approximation** is the strict parent because effective mass replaces a detailed band or quasiparticle response with a free-particle-like surrogate under explicit regime and error controls.
Einstein–Brillouin–Keller method Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by classical integrability, invariant torus, independent cycles, action normalization, Maslov indices, quantum numbers, semiclassical scale, and degeneracy or breakdown conditions.
Empirical valence bond Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the chemical states and environment, Hamiltonian matrix, diagonal potentials and coupling, calibration data, sampling protocol, reaction coordinate, free-energy estimator, uncertainty and transferability test.
Equation-Free Modeling Domain-specific is a kind of, typical Approximation
It substitutes on-demand fine-scale simulation for an unavailable closed coarse model, a tractable surrogate standing in for an intractable target.
Ergun equation Domain-specific is a kind of Approximation
Ergun Equation instantiates Approximation because it compresses unresolved packed-bed flow into an empirically calibrated two-term pressure-loss relation.
Euler–Bernoulli beam theory Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the beam geometry and slenderness, coordinate and sign convention, material and section rigidity, small-deflection and plane-section assumptions, load, boundary conditions and static or dynamic equation.
Explicit algebraic stress model Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the modeled Reynolds-stress anisotropy is an explicit objective algebraic function of the declared local tensors and turbulence-scale variables under the closure assumptions.
Finite difference Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the function and sampled domain, grid spacing, shift and difference operator, forward backward central or higher-order stencil, difference quotient and derivative target, truncation order, boundary treatment and stability and roundoff qualifications.
Finite Difference Method Domain-specific is a kind of Approximation
The broader abstraction is **Approximation**: FDM replaces a differential operator and continuous solution with a tractable grid surrogate, supplies an error measure, and refines that surrogate toward the target.
Finite Element Method Domain-specific is a kind of Approximation
The broader abstraction is **Approximation**: FEM replaces an infinite-dimensional variational solution with a tractable finite-dimensional surrogate, supplies norms and error bounds, and supports systematic refinement.
Fixed-precision arithmetic Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the radix and digit or bit width, integer fixed-point or floating-point layout, scale exponent and sign, representable set and range, arithmetic operations, rounding mode, overflow underflow and subnormal behavior, exceptional values, error model and reproducibility policy.
Formally smooth map Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by every square-zero or nilpotent extension in the declared category admits the required compatible lift.
Fraunhofer Diffraction Equation Domain-specific is a kind of Approximation
The Fraunhofer equation replaces fuller wave propagation with a valid far-field Fourier surrogate.
Fully polynomial-time approximation scheme Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the optimization problem and encoding, feasible-solution requirement, minimization or maximization guarantee, epsilon domain and error convention, algorithm family, running-time polynomial in input length and one over epsilon, randomized status and zero-optimum edge cases.
Fuzzy finite element Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by finite-element model, fuzzy variables and dependence, membership functions, alpha-cut or alternative propagation algorithm, optimization bounds, discretization, and validation.
Gaussian process emulator Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the simulator and input domain, output, design runs, preprocessing, GP mean and kernel, hyperparameters, observation or nugget model, conditioning equations, validation, extrapolation boundary and uncertainty interpretation.
Gauss–Jacobi Quadrature Domain-specific is a kind of Approximation
Gauss–Jacobi quadrature is a strict instance of **Approximation**.
Harmonic Balance Domain-specific is a kind of Approximation
**Approximation** is the broader abstraction this entry instantiates.
Hartree–Fock method Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the Hamiltonian, basis, particle statistics, determinant or restricted variant, exchange convention, self-consistency threshold, and omitted correlation.
Henyey–Greenstein phase function Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the incident and scattered directions and angle theta, asymmetry parameter g with magnitude below one, normalized phase-function formula and solid-angle convention, mean cosine interpretation, forward isotropic and backward limits, use in radiative-transfer equation and Monte Carlo sampling, wavelength and medium dependence and approximation limits and multi-term variants.
Holstein–Herring method Domain-specific is a kind of Approximation
Holstein–Herring Method instantiates Approximation because it replaces unstable total-energy subtraction with a controlled large-separation surface-flux evaluation whose error is tied to an asymptotic regime.
Kingman's Formula Domain-specific is a kind of Approximation
Kingman's Formula is a strict kind of Approximation: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.
Kramers–Moyal expansion Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the Markov state and transition kernel, short-time increment moments, coefficient definitions and limits, derivative order and signs, convergence assumptions, truncation and Pawula qualification and derived Fokker-Planck equation.
Lanczos Approximation Domain-specific is a kind of Approximation
**Approximation** is the strict parent because the finite formula delivers a controlled good-enough representation of Γ.
Lanczos resampling Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the input grid and sample units, output coordinates and scale, Lanczos order, exact kernel and support, normalization, boundary policy, color or multidimensional treatment, antialiasing and error or ringing evaluation.
Lebesgue's lemma Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the normed space, approximation subspace, bounded linear projection onto it, operator norm, target vector and best-approximation infimum are explicit and the stated inequality follows.
Leimkuhler–Matthews method Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the update uses the declared adjacent-increment combination and targets the invariant distribution of the stated overdamped stochastic differential equation.
Lie-to-children Domain-specific is a kind of Approximation
The explanation substitutes a tractable approximation for full theory.
Linear least squares Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the design matrix and response, dimensions and rank, residual orientation, norm or weight matrix, parameter constraints, minimizer and uniqueness convention, numerical method, conditioning, uncertainty model if statistical and diagnostics.
Lumen method Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the room geometry and work plane, target average illuminance, luminaire and lamp lumen output, number of lamps and luminaires, room-cavity ratio, surface reflectances, coefficient of utilization, maintenance or light-loss factor, total effective lumens, area and calculated average, fixture-count rounding and layout uniformity and point-calculation limits.
Marcinkiewicz interpolation theorem Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the source and target measure spaces, sublinear or quasilinear operator, endpoint exponent pairs, weak-type bounds and constants, interpolation parameter, derived intermediate exponents, strong-type inequality and excluded endpoint or infinite-measure cases.
May spectral sequence Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the filtration, grading, differential conventions, and convergence target are fixed so the spectral sequence abuts to the declared Ext object.
Method of image charges Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the physical region and real charges, conductor or dielectric boundary geometry, Dirichlet or Neumann conditions, fictitious image locations and magnitudes, candidate potential, boundary verification, uniqueness theorem, allowed evaluation region and induced surface charge force and energy qualifications.
Method stub Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the class module or service and method signature, parameters and return or exception contract, placeholder body, sentinel or temporary behavior, dependent callers, conspicuous incompleteness marker, lifecycle and replacement criterion, test and build treatment and distinction from mock abstract method and production fallback.
Mie potential Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the particle pair and coarse-graining, distance, repulsive and attractive exponents, exponent ordering, energy and length parameters, normalization, minimum, force derivative and cutoff or mixing rules.
Model compression Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the source model task and baseline metrics, target deployment environment, compression objective and resource budget, pruning quantization factorization weight sharing distillation or architecture reduction method, compressed model, calibration and fine-tuning, size memory latency energy and throughput measures, accuracy robustness calibration and subgroup retention, hardware realization and compression ratio and Pareto tradeoff.
Motion interpolation Domain-specific is a kind of Approximation
The generated frame is literally a good-enough representation of an unobserved temporal sample inferred from neighboring evidence; motion, occlusion, and cadence semantics provide the domain-specific residual.
Multi-Configuration Time-Dependent Hartree Domain-specific is a kind of Approximation
**Approximation** is the broader abstraction this entry instantiates: MCTDH is a strict, controlled approximation by an adaptive variational manifold.
Multifit algorithm Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by job sizes, machine count, initial bounds, FFD ordering and tie rules, iteration or tolerance limit, feasibility test, and approximation guarantee.
N-electron valence state perturbation theory Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the molecular Hamiltonian and basis, electrons and active orbitals, CAS reference and state averaging, zeroth-order Hamiltonian, contraction variant, perturber classes, denominators, energy correction and convergence diagnostics.
Natural Element Method Domain-specific is a kind of Approximation
**Approximation** is the strict parent.
Open-Circuit Time-Constant Method Domain-specific is a kind of Approximation
The Open-Circuit Time-Constant Method is an Approximation that estimates a circuit's high-frequency corner from a summed first-order resistance–capacitance surrogate.
Orthogonality principle Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the unknown random variable or vector, observations and information sigma-algebra, admissible estimator class, squared-error inner product and finite-moment assumptions, estimator or projection, error residual, orthogonality conditions, normal equations and necessary-and-sufficient scope.
Osculating plane Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the regular C2 or smoother curve in Euclidean three-space and parameter value, point and velocity, unit tangent T, nonzero curvature and principal normal N, binormal B, affine plane through the point spanned by T and N or normal B, second-order contact, Frenet frame and relation to torsion and degeneracies.
Perfect spline Domain-specific is a kind of Approximation
What makes it its own entry: A univariate spline of order m whose m-th derivative takes alternating values plus or minus one between successive knots.
Point-normal triangle Domain-specific is a kind of Approximation
Point-Normal Triangle instantiates Approximation because it replaces an unknown smooth surface region with a computable cubic patch constrained by sparse point-normal data.
Proto-value function Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the MDP or sampled state space, transition graph and weights, Laplacian or diffusion operator, eigenproblem, basis selection, task independence, value approximation and coverage error.
Regge calculus Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the triangulated manifold and dimension, simplex edge lengths and signature, hinges and dihedral angles, deficit-angle curvature, dual volumes, Regge action and boundary terms, variation and discrete equations and continuum and numerical-convergence conditions.
Relaxation (approximation) Domain-specific is a kind of Approximation
What makes it its own entry: A heuristic approximation without a valid relaxation relation is not a relaxation, and a loose bound may be computationally easy but uninformative.
Riemann sum Domain-specific is a kind of Approximation
A Riemann sum is literally a finite good-enough representation of accumulated integral value, with partition, tags, and mesh giving its exact approximation structure.
Rule of 72 Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the initial quantity and constant rate, exponential rather than simple growth, rate units per period, compounding frequency, chosen rule constant, quotient units, exact logarithmic comparator, applicable rate range, approximation error, and doubling or halving interpretation.
Runge–Kutta method (SDE) Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the stage equations, stochastic integral interpretation, increment law, and claimed strong or weak order conditions are all fixed and satisfied.
Semicomputable function Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by one uniform computable approximation procedure converges monotonically to each function value from the declared side under fixed domain and representation conventions.
Shortcuts to adiabaticity Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by the finite-time protocol reaches the declared adiabatic target or path under a stated fidelity criterion without relying on the slow-limit theorem.
Simon–Glatzel equation Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by equation form, variable orientation, units, reference coexistence point, fitted parameters, material phase, dataset, and validity range are all stated.
Spectral method Domain-specific is a kind of Approximation
Every spectral discretization literally replaces an exact infinite-dimensional solution with a finite global-basis surrogate and evaluates its error under refinement; What makes it its own entry: global-basis finite-dimensional approximation plus a named residual-enforcement rule and regularity-dependent high-order convergence, rather than Fourier analysis alone, any high-order finite element, a spectral decomposition of an operator, or an unqualified promise of exponential accuracy.
Stone–Weierstrass Theorem Domain-specific is a kind of Approximation
Stone–Weierstrass is a strict specialization of **Approximation**: it supplies an exact structural criterion under which arbitrary continuous targets admit uniformly close representatives from a subalgebra.
Subderivative Domain-specific is a kind of Approximation
What makes it its own entry: Generalized derivatives outside convex analysis may obey different local definitions; the autonomous residual here is the convex supporting-hyperplane relation.
Supersymmetric WKB approximation Domain-specific is a kind of Approximation
The method approximates quantum spectra semiclassically.
Tangent measure Domain-specific is a kind of Approximation
What makes it its own entry: the domain-specific identity determined by there exist scales tending to zero and positive normalizations whose blown-up measures converge weakly to the claimed nonzero limit.
Tau-leaping Domain-specific is a kind of Approximation
What makes it its own entry: An approximate stochastic-simulation method that advances a reaction or event system by a finite time step while sampling multiple event counts from Poisson distributions.
Taylor series Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the function and scalar domain, expansion point, derivative existence, coefficient formula, series variable, radius or region of convergence, equality-to-function claim, partial sum and remainder bound.
Test particle Domain-specific is a kind of Approximation
It remains its own entry because its identity is fixed by the background system and field, probe object and retained property, small parameter justifying negligible backreaction, equation of response or motion, fixed-background assumption, observable extracted, perturbative error estimate and failure conditions and distinctions from tracer passive scalar and full two-way coupling.
Trilinear Interpolation Domain-specific is a kind of Approximation
**Approximation** is the strict parent because the unknown interior field value is replaced by a controlled local surrogate.
Truncation error Domain-specific is a kind of Approximation
Truncation replaces an exact process with a finite approximation.
Virtual fundamental class Domain-specific is a kind of Approximation
The class is a corrected surrogate for unavailable ordinary geometry.
Wigner Surmise Domain-specific is a kind of Approximation
**Approximation** is the strict parent because the exact 2×2 spacing law is used as a good-enough representation of the harder large-matrix law.
Zero differential overlap Domain-specific is a kind of Approximation
The candidate literally instantiates prime:approximation; its computational_quantum_chemistry restrictions provide the residual.
Asymptotic Behavior Prime is a kind of Approximation
Asymptotic behaviour is 'a special, disciplined kind of approximation' — the limiting move of keeping only the dominant term and classifying by growth class.
Dimensionality Reduction Prime is a kind of Approximation
Dimensionality Reduction is a kind of approximation: a low-dimensional surrogate stands in for high-dimensional data with controlled loss.
Estimation Prime is a kind of Approximation
The accepted reference-grade review places Estimation under Approximation because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Heuristic Prime is a kind of Approximation
A heuristic is a specialization of approximation in which a tractable rule of judgment is substituted for exhaustive optimal analysis.
Monte Carlo Simulation Prime is a kind of Approximation
Monte Carlo simulation is a kind of approximation that substitutes a sampled empirical distribution for an intractable analytical target.
Nonparametric Methods Prime is a kind of Approximation
Nonparametric Methods are a kind of approximation: ranks and flexible estimators substitute tractable surrogates for unspecified distributions.
L-Reduction Domain-specific presupposes Approximation
L-reduction **instantiates `prime:transformation`**.
Padé Table Domain-specific presupposes Approximation
Padé Table presupposes Approximation because every table entry is a rational approximation matching a power series to a prescribed order.
Eight-Node Quadratic Serendipity Quadrilateral (Q8) Domain-specific includes Approximation
The broader abstraction is **`prime:approximation`** through a strict compositional relation.
Randomized Rounding Domain-specific presupposes Approximation
**Approximation — strict prerequisite and the broader abstraction.** The method deliberately replaces exact discrete optimization with a tractable relaxation and produces a feasible result whose loss is bounded relative to the true optimum.
Spectral Element Method Domain-specific presupposes Approximation
Spectral Element Method compositionally presupposes **Approximation**: it replaces the exact PDE solution by a tractable piecewise-polynomial surrogate and evaluates accuracy in declared norms as \(h\) or \(p\) changes.
Engineering Tolerances Prime presupposes Approximation
Engineering tolerances presuppose approximation because defining permissible ranges around a nominal target is bounded-error substitution applied to manufacturing.
Progressive Refinement from Core Model Prime presupposes Approximation
Progressive refinement from a core model presupposes approximation because each successive correction is a controlled error term added to a tractable baseline.
Fluid Limit Domain-specific is a decomposition of Approximation
A fluid limit is a deterministic approximation obtained from a scaled stochastic process.
Kirkwood approximation Domain-specific is a decomposition of Approximation
The Kirkwood construction is a domain-specific approximation that replaces a joint distribution by products and quotients of lower-order marginals.
Design Prototyping Prime is a decomposition of Approximation
Design prototyping is the specific shape approximation takes when a tractable physical or interactive surrogate stands in for the eventual full product.
Perturbation Theory Prime is a decomposition of Approximation
Perturbation theory is the specific shape approximation takes when an intractable problem is split into a solvable part plus a small expansion parameter.

Hierarchy path (1) — routes to 1 parentless root

Approximation → is a decomposition of Representation → presupposes Abstraction

Not to Be Confused With¶

Approximation is not Bayesian Updating because Bayesian updating is the process of revising probability estimates as new evidence arrives; approximation is the use of a simplified or imprecise representation in place of exact values to gain computational tractability—Bayesian updating is about belief revision; approximation is about representation simplification.
Approximation is not Monte Carlo Simulation because Monte Carlo simulation uses random sampling to estimate solutions to complex problems; approximation is the use of a simplified or inexact value in place of the true value—Monte Carlo is a computational method; approximation is a representation strategy.
Approximation is not Heuristic because a heuristic is a practical rule that produces good results efficiently; approximation is the use of a simplified representation with known error bounds—heuristics are practical rules; approximation is representation simplification.
Approximation is not Probability because probability is the calibrated quantification of uncertainty; approximation is the use of an inexact value to represent a quantity—probability is about uncertainty quantification; approximation is about representation simplification.
Approximation is not Refinement because refinement is the iterative improvement of a candidate toward adequacy through feedback cycles; approximation is a single-step replacement of exact values with simplified ones for tractability—refinement is iterative improvement; approximation is static simplification.