Computing Atlas

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

Method of lines

Numerical Algorithm

The method of lines is a technique for solving partial differential equations in which every dimension but one is discretized. Reducing the equation to a single continuous dimension, usually time, turns it into a system of ordinary differential equations or differential-algebraic equations, which can then be handed to the many integration routines and software packages already written for those problems. In its most common form the spatial derivatives are approximated first and the time variable is left continuous, so a standard initial value solver advances the system. Because those solvers need an initial value problem, the method cannot be applied directly to purely elliptic equations such as Laplace's equation, although it has been used on them through the method of false transients, which adds an artificial time derivative, and through a semi-analytical variant that exploits the exponential of a matrix. The approach dates back to at least the early 1960s, and a long literature studies its accuracy and stability for different kinds of equation.

Connections

In Field

Source Method of lines (Wikipedia)
Sources
Method of lines (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead
    a technique for solving partial differential equations
  • In Field: Numerical analysis, Lead, field
    the numerical integration 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.