Alternating direction implicit method

Alternating direction implicit method

In mathematics, the alternating direction implicit (ADI) method [Peaceman, D. W. and Rachford, H. H., Jr., "The numerical solution of parabolic and elliptic differential equations",SIAM J. 3 (1955), 28-41, [http://www.ams.org/mathscinet-getitem?mr=71874 MR71874] ] is a finite difference method for solving parabolic and elliptic partial differential equations. It is most notably used to solve the problem of heat conduction or solving the diffusion equation in two or more dimensions.

The traditional method for solving the heat conduction equation is the method of Crank-Nicolson. This method is implicit, but has an unaffordable stability criterion in two or more dimensions.

The method

Consider the linear diffusion equation in two dimensions,

: {partial uover partial t} = left({partial^2 uover partial x^2 } +{partial^2 uover partial y^2 } ight) = ( u_{xx} + u_{yy} ) quad

The implicit Crank-Nicolson method produces the following finite difference equation:

: {u_{ij}^{n+1}-u_{ij}^nover Delta t} = {1 over 2}left(delta_x^2+delta_y^2 ight)left(u_{ij}^{n+1}+u_{ij}^n ight)

where delta_p^2 is the central difference operator for the "p"-coordinate.After performing a stability analysis, it can be shown that this method will be stable as long as

: {Delta t over (Delta x)^2}+{Delta tover (Delta y)^2} < {1 over 2}.

This an unaffordable numerical stability criterion.

The idea behind the ADI method is to split the finite difference equations into two, one with the x-derivative taken implicitly and the next with the y-derivative taken implicitly,

: {u_{ij}^{n+1/2}-u_{ij}^nover Delta t/2} = left(delta_x^2 u_{ij}^{n+1/2}+delta_y^2 u_{ij}^{n} ight)

: {u_{ij}^{n+1}-u_{ij}^{n+1/2}over Delta t/2} = left(delta_x^2 u_{ij}^{n+1/2}+delta_y^2 u_{ij}^{n+1} ight)

The systems of equations involved are tri-diagonal (symmetric banded with bandwidth 3), and thus cheap to solve by Choleski decomposition.

It can be shown that this method is unconditionally stable. There are more refined ADI methods such as the methods of Douglas [Douglas, J. "Alternating direction methods for three space variables," Numerische Mathematik, Vol 4., pp 41-63 (1962)] , or the f-factor method [Chang, M.J. et al. "Improved alternating-direction implicit method for solving transient three-dimensional heat diffusion problems", Numerical Heat Transfer, Vol 19, pp 69-84, (1991)] which can be used for three or more dimensions.

References


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Method of lines — The method of lines (MOL, NMOL, NUMOL) (Schiesser, 1991; Hamdi, et al., 2007; Schiesser, 2009 ) is a technique for solving partial differential equations (PDEs) in which all but one dimension is discretized. MOL allows standard, general purpose… …   Wikipedia

  • Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.[1] It is a second order method in time, implicit in time, and is numerically …   Wikipedia

  • Collocation method — In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations. The idea is to choose a finite dimensional space of candidate solutions… …   Wikipedia

  • Schwarz alternating method — In mathematics, the Schwarz alternating method, named after Hermann Schwarz, is an iterative method to find the solution of a partial differential equations on a domain which is the union of two overlapping subdomains, by solving the equation on… …   Wikipedia

  • Spectral method — Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain Dynamical Systems, often involving the use of the Fast Fourier Transform. Where applicable, spectral methods have… …   Wikipedia

  • Multigrid method — Multigrid (MG) methods in numerical analysis are a group of algorithms for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in (but not… …   Wikipedia

  • Discontinuous Galerkin method — Discontinuous Galerkin methods (DG methods) in mathematics form a class of numerical methods for solving partial differential equations. They combine features of the finite element and the finite volume framework and have been successfully… …   Wikipedia

  • Neumann–Dirichlet method — In mathematics, the Neumann–Dirichlet method is a domain decomposition preconditioner which involves solving Neumann boundary value problem on one subdomain and Dirichlet boundary value problem on another, adjacent across the interface between… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”