Linked from

The 75 pages that link to Numerical analysis, each with the reason it gives.

• Taylor seriesNarrower topic: Taylor polynomials support error estimates and local approximation methods in computation.

• Metric spaceNarrower topic: Error bounds and convergence often use distances on spaces of inputs or solutions.

• Climate modelNarrower topic: Climate models solve complex equations approximately on finite grids and time steps.

• Triangle inequalityNarrower topic: Proofs of numerical error bounds routinely combine distances with the triangle inequality.

• Newton's methodNarrower topic: Newton's method is a root-finding algorithm analyzed within this broader discipline.

• Perturbation theoryNarrower topic: Numerical methods approximate solutions directly rather than correcting an analytic reference solution.

• Power seriesNarrower topic: Truncated power series can approximate functions in numerical calculations.

• SequenceNarrower topic: Numerical methods often produce sequences of approximations to a solution.

• CalculusRelated: Computers typically approximate derivatives and integrals rather than manipulate limits exactly.

• ENIACNarrower topic: ENIAC’s workloads were numerical problems requiring extensive arithmetic.

• Floating-point arithmeticNarrower topic: It analyzes how finite precision affects computed solutions.

• Infinite seriesRelated: Truncating a convergent series turns its limit into a computable approximation.

• Asymptotic analysisCompared with: It often seeks finite-input accuracy, while asymptotic analysis emphasizes limiting behavior.

• Significant figuresRelated: Numerical results need precision choices suited to algorithmic error, not just input digit counts.

• Nonlinear systemRelated: Nonlinear systems often lack closed-form solutions and require numerical methods.

• Computer simulationRelated: Numerical methods make continuous equations computable on finite machines.

• FortranNarrower topic: Fortran’s original purpose was to express the calculations used in numerical analysis.

• SimulationRelated: Numerical methods turn equations that lack practical exact solutions into simulated results.

• Scientific computingNarrower topic: It explains accuracy and stability limits in scientific calculations.

• EquationNarrower topic: When exact solutions are unavailable, numerical methods approximate equation roots.

• Polynomial equationNarrower topic: It addresses equations whose roots cannot be expressed conveniently in exact form.

• Polynomial functionNarrower topic: Polynomial evaluation and approximation are central tools in numerical computation.

• ConvergenceNarrower topic: Its error and stability analyses often ask whether approximations converge as resolution improves.

• Inverse trigonometric functionsRelated: Computing inverse angles requires stable algorithms and careful quadrant conventions.

• Quadratic formulaRelated: For extreme coefficients, direct evaluation of the formula can lose precision, motivating stable variants.

• RoundingNarrower topic: It analyzes when rounding is harmless and when it changes computational results.

• Symbolic computationCompared with: Numerical analysis targets reliable approximations where symbolic computation seeks exact expressions.

• Applied mathematicsRelated: Many applied problems lack exact solutions, making controlled numerical approximation essential.

• Computer algebra systemCompared with: Numerical methods handle many problems that lack compact symbolic solutions or require approximate values.

• Katherine JohnsonRelated: Computing usable flight paths required turning equations of motion into numerical results.

• Mathematical analysisCompared with: It addresses how analytic problems can be solved reliably when exact answers are unavailable.

• Alternating harmonic seriesNarrower topic: Truncating the series gives a simple approximation with a rigorous error bound.

• Mandelbrot setRelated: Computer rendering tests many parameter values using finite iteration and escape criteria.

• Padé approximantNarrower topic: Padé approximation is one tool for computing with functions from finite series data.

• Taylor polynomialNarrower topic: Taylor polynomials provide local approximations used in numerical algorithms.

• Analog computerCompared with: Numerical methods approximate solutions through discrete steps instead of a physical analog model.

• Lagrange interpolationNarrower topic: Interpolation is a standard tool for approximating functions from sampled values.

• Polynomial evaluationNarrower topic: Reliable polynomial evaluation is a standard numerical-analysis problem.

• Secant methodNarrower topic: The secant method is a root-finding algorithm analyzed within this broader discipline.

• Geometric analysisCompared with: Computational approximation can support geometric analysis but differs from its theoretical study of existence and structure.

• Horner's methodNarrower topic: Horner's procedure belongs to the long history of practical numerical computation.

• Procedural programmingRelated: Numerical algorithms are frequently implemented as procedures that update values through iterations.

• Zero of a functionNarrower topic: When exact solutions are unavailable, numerical analysis supplies methods and error guarantees for locating zeros.

• Computational physicsNarrower topic: Its error analysis and stability tools determine whether a physical simulation is trustworthy.

• Euler methodNarrower topic: Euler’s method is a foundational example of numerical analysis applied to differential equations.

• Local truncation errorNarrower topic: Local truncation error is a basic accuracy measure within this broader field.

• EDSACNarrower topic: EDSAC accelerated calculations that Cambridge researchers had previously performed by hand or with desk machines.

• Harvard Mark INarrower topic: The machine automated lengthy numerical procedures that people had performed by hand.

• Heine–Cantor theoremRelated: Uniform continuity helps relate small input perturbations to controlled output errors on compact regions.

• Pafnuty ChebyshevRelated: Chebyshev polynomials and nodes support stable approximation and computational methods.