Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Group

Numerical Integration and Differential Equations

This group gathers numerical algorithms for computing an integral or solving a differential equation, including the trapezoidal rule, Simpson's rule, Romberg's method, the Runge-Kutta family of methods, predictor-corrector methods, automatic differentiation for computing exact derivatives, and iterative methods for computing mathematical constants such as pi, including the Gauss-Legendre and Chudnovsky algorithms. Their shared work is approximating a continuous mathematical quantity, an area, a derivative or the solution to a differential equation, as distinct from finding a single root or optimum, which belongs to Root-Finding and Optimization.

Facts
Comparison
Era of Emergence
1768 1
Browse By
Numerical Integration and Differential Equations
Filter Results44 entries

2Sum

Numerical Algorithm

Alternating-direction implicit method

Numerical Algorithm
2 links

Automatic Differentiation

Numerical Algorithm
2 links

Backward Euler method

Numerical Algorithm
1 link

Beeman's algorithm

Numerical Algorithm
1 link

Boole's rule

Numerical Algorithm
2 links

Borwein's algorithm

Numerical Algorithm
1 link

Cash-Karp method

Numerical Algorithm
2 links

Chudnovsky Algorithm

Numerical Algorithm
1 link

Crank-Nicolson method

Numerical Algorithm
1 link

Discontinuous Galerkin method

Numerical Algorithm
1 link

Domain Reduction Algorithm

Numerical Algorithm
1 link

Dormand-Prince method

Numerical Algorithm
5 links

Euler method

Numerical Algorithm
1 link

Finite-difference time-domain method

Numerical Algorithm
1 link

FTCS scheme

Numerical Algorithm
1 link

Gauss-Hermite quadrature

Numerical Algorithm
1 link

Gauss-Legendre Algorithm

Numerical Algorithm
3 links

Gauss-Legendre quadrature

Numerical Algorithm
1 link

Kahan summation algorithm

Numerical Algorithm
2 links

Lax-Friedrichs method

Numerical Algorithm
2 links

Lax-Wendroff method

Numerical Algorithm
1 link

Liu Hui's π algorithm

Numerical Algorithm
2 links

Method of characteristics

Numerical Algorithm

Method of lines

Numerical Algorithm
1 link

Midpoint method

Numerical Algorithm
1 link

Monte Carlo integration

Numerical Algorithm
1 link

Multigrid method

Numerical Algorithm
1 link

Nested sampling algorithm

Numerical Algorithm
1 link

Numerical integration

Numerical Algorithm
1 link

Predictor-Corrector Method

Numerical Algorithm

Proper generalized decomposition

Numerical Algorithm
3 links

Richardson extrapolation

Numerical Algorithm
1 link

Romberg's Method Algorithm

Numerical Algorithm

Runge-Kutta Method Algorithm

Numerical Algorithm
1 link

Runge-Kutta-Fehlberg method

Numerical Algorithm
1 link

Semi-implicit Euler method

Numerical Algorithm

SIMPLE algorithm

Numerical Algorithm
1 link

Simpson's Rule

Numerical Algorithm
1 link

Tai's model

Numerical Algorithm

Trapezoidal rule (differential equations)

Numerical Algorithm
1 link

Trapezoidal Rule Algorithm

Numerical Algorithm

Upwind scheme

Numerical Algorithm
1 link

Volume of fluid method

Numerical Algorithm
1 link
Sources
1. Wikipedia: Numerical methods for ordinary differential equations
Wikimedia FoundationNumerical methods for ordinary differential equations, lead section, Euler sentence
Quote, Numerical methods for ordinary differential equations, lead section, Euler sentence
The method is named after Leonhard Euler who described it in 1768.
View the Source
Crank-Nicolson method (Wikipedia)
Has Member: Crank-Nicolson method, Lead section
Quote, Has Member: Crank-Nicolson method, Lead section
the Crank-Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.
View the Source
Kahan summation algorithm (Wikipedia)
Has Member: Kahan summation algorithm, Lead, first sentence
Quote, Has Member: Kahan summation algorithm, Lead, first sentence
In numerical analysis, the Kahan summation algorithm
View the Source
Dormand-Prince method (Wikipedia)
Has Member: Dormand-Prince method, Lead
Quote, Has Member: Dormand-Prince method, Lead
is an embedded method for solving ordinary differential equations (ODE).
View the Source
Upwind scheme (Wikipedia)
Has Member: Upwind scheme, Lead
Quote, Has Member: Upwind scheme, Lead
In computational physics, the term advection scheme refers to a class of numerical discretization methods for solving hyperbolic partial differential equations.
View the Source
Beeman's algorithm (Wikipedia)
Has Member: Beeman's algorithm, Lead paragraph
Quote, Has Member: Beeman's algorithm, Lead paragraph
is a method for numerically integrating ordinary differential equations of order 2
View the Source
Cash-Karp method (Wikipedia)
Has Member: Cash-Karp method, Lead paragraph
Quote, Has Member: Cash-Karp method, Lead paragraph
is a method for solving ordinary differential equations (ODEs)
View the Source
SIMPLE algorithm (Wikipedia)
Has Member: SIMPLE algorithm, Lead section
Quote, Has Member: SIMPLE algorithm, Lead section
the SIMPLE algorithm is a widely used numerical procedure to solve the Navier-Stokes equations.
View the Source
Richardson extrapolation (Wikipedia)
Has Member: Richardson extrapolation, Lead, paragraph 4
Quote, Has Member: Richardson extrapolation, Lead, paragraph 4
Practical applications of Richardson extrapolation include Romberg integration, which applies Richardson extrapolation to the trapezoid rule, and the Bulirsch-Stoer algorithm for solving ordinary differential equations.
View the Source
2Sum (Wikipedia)
Has Member: 2Sum, Lead
Quote, Has Member: 2Sum, Lead
2Sum is a floating-point algorithm for computing the exact round-off error in a floating-point addition operation.
View the Source
Midpoint method (Wikipedia)
Has Member: Midpoint method, Lead
Quote, Has Member: Midpoint method, Lead
In numerical analysis, a branch of applied mathematics, the midpoint method is a one-step method for numerically solving the differential equation,
View the Source
Gauss-Hermite quadrature (Wikipedia)
Has Member: Gauss-Hermite quadrature, Lead
Quote, Has Member: Gauss-Hermite quadrature, Lead
Gauss-Hermite quadrature is a form of Gaussian quadrature for approximating the value of integrals of the following kind:
View the Source
Lax-Wendroff method (Wikipedia)
Has Member: Lax-Wendroff method, Lead
Quote, Has Member: Lax-Wendroff method, Lead
The Lax-Wendroff method, named after Peter Lax and Burton Wendroff, is a numerical method for the solution of hyperbolic partial differential equations, based on finite differences.
View the Source
Tai's model (Wikipedia)
Has Member: Tai's model, Lead
Quote, Has Member: Tai's model, Lead
a method of estimating the area under a curve by dividing the area into simple polygons and summing their totals
View the Source
Numerical integration (Wikipedia)
Has Member: Numerical integration, Lead
Quote, Has Member: Numerical integration, Lead
numerical integration comprises a broad family of algorithms for calculating the numerical value of a definite integral.
View the Source
Lax-Friedrichs method (Wikipedia)
Has Member: Lax-Friedrichs method, Lead
Quote, Has Member: Lax-Friedrichs method, Lead
is a numerical method for the solution of hyperbolic partial differential equations based on finite differences
View the Source
Liu Hui's π algorithm (Wikipedia)
Has Member: Liu Hui's π algorithm, Lead
Quote, Has Member: Liu Hui's π algorithm, Lead
Liu Hui was the first Chinese mathematician to provide a rigorous algorithm for calculation of π to any accuracy.
View the Source
Boole's rule (Wikipedia)
Has Member: Boole's rule, Lead
Quote, Has Member: Boole's rule, Lead
numerical quadrature arising in calculus
View the Source
Method of lines (Wikipedia)
Has Member: Method of lines, Lead
Quote, Has Member: Method of lines, Lead
a technique for solving partial differential equations
View the Source
Finite-difference time-domain method (Wikipedia)
Has Member: Finite-difference time-domain method, Lead
Quote, Has Member: Finite-difference time-domain method, Lead
Finite difference schemes for time-dependent partial differential equations (PDEs) have been employed for many years
View the Source
Method of characteristics (Wikipedia)
Has Member: Method of characteristics, Lead
Quote, Has Member: Method of characteristics, Lead
the method of characteristics is a technique for solving particular partial differential equations
View the Source
Trapezoidal rule (differential equations) (Wikipedia)
Has Member: Trapezoidal rule (differential equations), Lead
Quote, Has Member: Trapezoidal rule (differential equations), Lead
the trapezoidal rule is a numerical method to solve ordinary differential equations derived from the trapezoidal rule for computing integrals
View the Source
Discontinuous Galerkin method (Wikipedia)
Has Member: Discontinuous Galerkin method, Lead
Quote, Has Member: Discontinuous Galerkin method, Lead
discontinuous Galerkin methods (DG methods) form a class of numerical methods for solving differential equations
View the Source
Borwein's algorithm (Wikipedia)
Has Member: Borwein's algorithm, Lead
Quote, Has Member: Borwein's algorithm, Lead
Borwein's algorithm was devised by Jonathan and Peter Borwein
View the Source
Nested sampling algorithm (Wikipedia)
Has Member: Nested sampling algorithm, Background
Quote, Has Member: Nested sampling algorithm, Background
The nested sampling algorithm was developed by John Skilling specifically to approximate these marginalization integrals
View the Source
Volume of fluid method (Wikipedia)
Has Member: Volume of fluid method, Lead
Quote, Has Member: Volume of fluid method, Lead
numerical techniques for tracking and locating the free surface
View the Source
Alternating-direction implicit method (Wikipedia)
Has Member: Alternating-direction implicit method, Lead, partial differential equations
Quote, Has Member: Alternating-direction implicit method, Lead, partial differential equations
It is also used to numerically solve parabolic and elliptic partial differential equations, and is a classic method used for modeling heat conduction and solving the diffusion equation in two or more dimensions.
View the Source
Proper generalized decomposition (Wikipedia)
Has Member: Proper generalized decomposition, Lead
Quote, Has Member: Proper generalized decomposition, Lead
The proper generalized decomposition (PGD) is an iterative numerical method for solving boundary value problems
View the Source
Monte Carlo integration (Wikipedia)
Has Member: Monte Carlo integration, Lead section
Quote, Has Member: Monte Carlo integration, Lead section
is a technique for numerical integration using random numbers
View the Source
Euler method (Wikipedia)
Has Member: Euler method, Lead section
Quote, Has Member: Euler method, Lead section
first-order numerical procedure for solving ordinary differential equations
View the Source
FTCS scheme (Wikipedia)
Has Member: FTCS scheme, Lead section
Quote, Has Member: FTCS scheme, Lead section
finite difference method used for numerically solving the heat equation
View the Source
Backward Euler method (Wikipedia)
Has Member: Backward Euler method, Lead section
Quote, Has Member: Backward Euler method, Lead section
for the solution of ordinary differential equations
View the Source
Semi-implicit Euler method (Wikipedia)
Has Member: Semi-implicit Euler method, Lead section
Quote, Has Member: Semi-implicit Euler method, Lead section
modification of the Euler method for solving Hamilton's equations
View the Source
Multigrid method (Wikipedia)
Has Member: Multigrid method, Lead section
Quote, Has Member: Multigrid method, Lead section
is an algorithm for solving differential equations using a hierarchy of discretizations
View the Source
Gauss-Legendre quadrature (Wikipedia)
Has Member: Gauss-Legendre quadrature, Lead section
Quote, Has Member: Gauss-Legendre quadrature, Lead section
approximating the definite integral of a function
View the Source
Runge-Kutta-Fehlberg method (Wikipedia)
Has Member: Runge-Kutta-Fehlberg method, Lead section
Quote, Has Member: Runge-Kutta-Fehlberg method, Lead section
numerical solution of ordinary differential equations
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.