An iterative starting method to control parasitism for the Leapfrog method

Adrian Hill, Terence Norton

Research output: Contribution to journalArticle

1 Citation (Scopus)
25 Downloads (Pure)

Abstract

The Leapfrog method is a time–symmetric multistep method, widely used to solve the Euler equations and other Hamiltonian systems, due to its low cost and geometric properties. A drawback with Leapfrog is that it suffers from parasitism. This paper describes an iterative starting method, which may be used to reduce to machine precision the size of the parasitic components in the numerical solution at the start of the computation. The severity of parasitic growth is also a function of the differential equation, the main method and the time–step. When the tendency to parasitic growth is relatively mild, computational results indicate that using this iterative starting method may significantly increase the time–scale over which parasitic effects remain acceptably small. Using an iterative starting method, Leapfrog is applied to the cubic Schrödinger equation. The computational results show that the Hamiltonian and soliton behaviour are well–preserved over long time-scales.
Original languageEnglish
Article numberVolume 87
Pages (from-to)145
Number of pages156
JournalApplied Numerical Mathematics
Volume87
Issue number1
Early online date30 Oct 2014
Publication statusPublished - 1 Jan 2015

Fingerprint

Hamiltonians
Iteration
Computational Results
Euler equations
Time Scales
Solitons
Cubic equation
Multistep Methods
Differential equations
Euler Equations
Hamiltonian Systems
Schrödinger Equation
Numerical Solution
Differential equation
Costs

Keywords

  • Parasitism, starting method

Cite this

An iterative starting method to control parasitism for the Leapfrog method. / Hill, Adrian; Norton, Terence.

In: Applied Numerical Mathematics, Vol. 87, No. 1, Volume 87, 01.01.2015, p. 145.

Research output: Contribution to journalArticle

@article{3876a9165b0e407f9fc4ecfeed71cf4a,
title = "An iterative starting method to control parasitism for the Leapfrog method",
abstract = "The Leapfrog method is a time–symmetric multistep method, widely used to solve the Euler equations and other Hamiltonian systems, due to its low cost and geometric properties. A drawback with Leapfrog is that it suffers from parasitism. This paper describes an iterative starting method, which may be used to reduce to machine precision the size of the parasitic components in the numerical solution at the start of the computation. The severity of parasitic growth is also a function of the differential equation, the main method and the time–step. When the tendency to parasitic growth is relatively mild, computational results indicate that using this iterative starting method may significantly increase the time–scale over which parasitic effects remain acceptably small. Using an iterative starting method, Leapfrog is applied to the cubic Schr{\"o}dinger equation. The computational results show that the Hamiltonian and soliton behaviour are well–preserved over long time-scales.",
keywords = "Parasitism, starting method",
author = "Adrian Hill and Terence Norton",
year = "2015",
month = "1",
day = "1",
language = "English",
volume = "87",
pages = "145",
journal = "Applied Numerical Mathematics",
issn = "0168-9274",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - An iterative starting method to control parasitism for the Leapfrog method

AU - Hill, Adrian

AU - Norton, Terence

PY - 2015/1/1

Y1 - 2015/1/1

N2 - The Leapfrog method is a time–symmetric multistep method, widely used to solve the Euler equations and other Hamiltonian systems, due to its low cost and geometric properties. A drawback with Leapfrog is that it suffers from parasitism. This paper describes an iterative starting method, which may be used to reduce to machine precision the size of the parasitic components in the numerical solution at the start of the computation. The severity of parasitic growth is also a function of the differential equation, the main method and the time–step. When the tendency to parasitic growth is relatively mild, computational results indicate that using this iterative starting method may significantly increase the time–scale over which parasitic effects remain acceptably small. Using an iterative starting method, Leapfrog is applied to the cubic Schrödinger equation. The computational results show that the Hamiltonian and soliton behaviour are well–preserved over long time-scales.

AB - The Leapfrog method is a time–symmetric multistep method, widely used to solve the Euler equations and other Hamiltonian systems, due to its low cost and geometric properties. A drawback with Leapfrog is that it suffers from parasitism. This paper describes an iterative starting method, which may be used to reduce to machine precision the size of the parasitic components in the numerical solution at the start of the computation. The severity of parasitic growth is also a function of the differential equation, the main method and the time–step. When the tendency to parasitic growth is relatively mild, computational results indicate that using this iterative starting method may significantly increase the time–scale over which parasitic effects remain acceptably small. Using an iterative starting method, Leapfrog is applied to the cubic Schrödinger equation. The computational results show that the Hamiltonian and soliton behaviour are well–preserved over long time-scales.

KW - Parasitism, starting method

M3 - Article

VL - 87

SP - 145

JO - Applied Numerical Mathematics

JF - Applied Numerical Mathematics

SN - 0168-9274

IS - 1

M1 - Volume 87

ER -