Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Computational Problem

Numerical solution of partial differential equations

Numerical solution of partial differential equations is the computational task of finding approximate answers to partial differential equations, the equations that relate a quantity to its rates of change across several variables such as space and time, when an exact formula is not practical. It is studied as a branch of numerical analysis, with specialized methods for hyperbolic, parabolic and elliptic equations. The usual approach replaces the continuous problem with a finite one. The finite difference method stores values at grid points and approximates derivatives by differences between them. The method of lines discretizes every dimension but one, so that solvers built for ordinary differential equations can be reused. Finite element, finite volume and spectral methods instead represent the solution through small elements, fluxes across small volumes, or global basis functions. Domain decomposition and multigrid methods then speed up solving the very large systems these produce. The source regards finite difference as the simplest to learn, finite element and finite volume as well suited to complicated geometries, and spectral methods as the most accurate when the solution is smooth.

Numerical solution of partial differential equations
Filter Results3 entries
Connections

Solved By Algorithms

Source Alternating-direction implicit method (Wikipedia)
Source Proper generalized decomposition (Wikipedia)
Source Relaxation (iterative method) (Wikipedia)
Sources
Numerical methods for partial differential equations (Wikipedia)
Alternating-direction implicit method (Wikipedia)
Solved By Algorithms: Alternating-direction implicit method, Lead, parabolic and elliptic equations
Quote, Solved By Algorithms: Alternating-direction implicit method, Lead, parabolic and elliptic equations
It is also used to numerically solve parabolic and elliptic partial differential equations
View the Source
Relaxation (iterative method) (Wikipedia)
Solved By Algorithms: Relaxation (iterative method), Lead, elliptic equations
Quote, Solved By Algorithms: Relaxation (iterative method), Lead, elliptic equations
Relaxation methods are important especially in the solution of linear systems used to model elliptic partial differential equations, such as Laplace's equation and its generalization, Poisson's equation.
View the Source
Proper generalized decomposition (Wikipedia)
Solved By Algorithms: Proper generalized decomposition, Lead, partial differential equations
Quote, Solved By Algorithms: Proper generalized decomposition, Lead, partial differential equations
partial differential equations constrained by a set of boundary conditions
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.