KnowraNumerical analysisLinked fromLinked fromThe 75 pages that link to Numerical analysis, each with the reason it gives.All 75Related 26Narrower topic 41Compared with 8Taylor 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.ENIACNarrower topic: ENIAC’s workloads were numerical problems requiring extensive arithmetic.Floating-point arithmeticNarrower topic: It analyzes how finite precision affects computed solutions.FortranNarrower topic: Fortran’s original purpose was to express the calculations used in numerical analysis.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.RoundingNarrower topic: It analyzes when rounding is harmless and when it changes computational results.Alternating harmonic seriesNarrower topic: Truncating the series gives a simple approximation with a rigorous error bound.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.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.Horner's methodNarrower topic: Horner's procedure belongs to the long history of practical numerical computation.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.Kathleen AntonelliNarrower topic: Antonelli’s programming translated numerical methods into executable ENIAC operations.MATLABNarrower topic: MATLAB’s numerical routines address the computational problems studied in this field.Regula falsiNarrower topic: Regula falsi became a standard algorithmic topic within this field.The Art of Computer ProgrammingNarrower topic: Volume 2 treats numerical procedures and the reliability of their computed results.Brook TaylorNarrower topic: Taylor approximations help estimate functions and analyze computational error.Douglas HartreeNarrower topic: Hartree developed practical computation to solve equations that resisted exact analytical treatment.Jamshid al-KashiNarrower topic: His iterative calculations exemplify numerical methods developed before modern analysis.Computational astrophysicsNarrower topic: It explains accuracy, stability, and error in computations of physical systems.Ioana DumitriuNarrower topic: Dumitriu’s work includes algorithms and computational questions in this field.Series expansionNarrower topic: Truncated expansions provide computable approximations with estimable errors.Value (mathematics)Narrower topic: Computed values may be approximations when exact evaluation is unavailable.
KnowraNumerical analysisLinked fromLinked fromThe 75 pages that link to Numerical analysis, each with the reason it gives.All 75Related 26Narrower topic 41Compared with 8Taylor 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.ENIACNarrower topic: ENIAC’s workloads were numerical problems requiring extensive arithmetic.Floating-point arithmeticNarrower topic: It analyzes how finite precision affects computed solutions.FortranNarrower topic: Fortran’s original purpose was to express the calculations used in numerical analysis.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.RoundingNarrower topic: It analyzes when rounding is harmless and when it changes computational results.Alternating harmonic seriesNarrower topic: Truncating the series gives a simple approximation with a rigorous error bound.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.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.Horner's methodNarrower topic: Horner's procedure belongs to the long history of practical numerical computation.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.Kathleen AntonelliNarrower topic: Antonelli’s programming translated numerical methods into executable ENIAC operations.MATLABNarrower topic: MATLAB’s numerical routines address the computational problems studied in this field.Regula falsiNarrower topic: Regula falsi became a standard algorithmic topic within this field.The Art of Computer ProgrammingNarrower topic: Volume 2 treats numerical procedures and the reliability of their computed results.Brook TaylorNarrower topic: Taylor approximations help estimate functions and analyze computational error.Douglas HartreeNarrower topic: Hartree developed practical computation to solve equations that resisted exact analytical treatment.Jamshid al-KashiNarrower topic: His iterative calculations exemplify numerical methods developed before modern analysis.Computational astrophysicsNarrower topic: It explains accuracy, stability, and error in computations of physical systems.Ioana DumitriuNarrower topic: Dumitriu’s work includes algorithms and computational questions in this field.Series expansionNarrower topic: Truncated expansions provide computable approximations with estimable errors.Value (mathematics)Narrower topic: Computed values may be approximations when exact evaluation is unavailable.