Math 2.0

Numerical analysis Definition

Method of lines

Builds on Initial value problemFinite difference methodHeat equationEuler methodNumerical methods for ordinary differential equations

Definition

Consider an evolution equation ut=𝒜(u)u_t = \mathcal{A}(u) for an unknown u(x,t)u(x, t), x∈Ω⊆ℝmx \in \Omega \subseteq \R^m, t≥0t \ge 0. Here 𝒜\mathcal{A} is a differential operator in the space variable xx. Boundary conditions and an initial value u(⋅,0)=u0u(\cdot, 0) = u_0 are given. The method of lines computes an approximate solution in two steps.

  1. Semi-discretisation: choose a spatial discretisation with NN unknowns, such as finite differences on a grid. Choose an operator AN ⁣:ℝN→ℝNA_N \colon \R^N \to \R^N that approximates 𝒜\mathcal{A} with the boundary conditions built in. This gives the system of ordinary differential equations U′(t)=AN(U(t))U'(t) = A_N(U(t)), with U(0)U(0) an approximation of u0u_0.
  2. Time integration: solve this initial value problem with a numerical method for ordinary differential equations.

Remarks

Example: for the heat equation ut=uxxu_t = u_{xx} on (0,1)(0, 1) with zero boundary values and grid xj=jΔxx_j = j \Delta x, Δx=1/(N+1)\Delta x = 1/(N + 1), step 1 gives Uj′=(Uj+1−2Uj+Uj−1)/Δx2U_j' = (U_{j+1} - 2U_j + U_{j-1}) / \Delta x^2 for 1≤j≤N1 \le j \le N, with U0=UN+1=0U_0 = U_{N+1} = 0. Step 2 with the Euler method and step size Δt\Delta t gives the explicit scheme Ujn+1=Ujn+r(Uj+1n−2Ujn+Uj−1n)U_j^{n+1} = U_j^n + r (U_{j+1}^n - 2U_j^n + U_{j-1}^n) with r=Δt/Δx2r = \Delta t / \Delta x^2. The eigenvalues of the semi-discrete matrix lie in (−4/Δx2,0)(-4/\Delta x^2, 0), and the Euler method is stable for Δtλ∈[−2,0]\Delta t \lambda \in [-2, 0], so the scheme is stable when r≤1/2r \le 1/2. Non-example: Rothe's method discretises time first, which gives a sequence of elliptic boundary value problems in xx; it fails clause 1, since no system of ODEs is formed. The semi-discrete systems are often stiff, because their eigenvalues grow like Δx−2\Delta x^{-2} for diffusion, so implicit or stabilised time integrators are used.

Reading path

To understand this page from the ground up, read these 15 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Differential equation concept
  2. Finite difference method concept
  3. Function concept
  4. Heat equation concept
  5. Initial value problem concept
  6. Interval concept
  7. Numerical methods for ordinary differential equations concept
  8. Ordinary differential equation definition
  9. Lipschitz condition definition
  10. Grönwall's inequality statement
  11. Discrete Grönwall inequality statement
  12. Solution of an ordinary differential equation definition
  13. Initial value problem definition
  14. Euler method concept
  15. Method of lines definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Method_of_lines
About this page
Tag7M6MQ2HB1X
URIm2://7M6MQ2HB1X
Kinddefinition
WritingW0 stub
MSC65M20
DefinesMethod of lines
UsesInitial value problem, Finite difference method, Heat equation, Euler method, Numerical methods for ordinary differential equations

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.