An iterative starting method to control parasitism for the Leapfrog method

DOI10.1016/J.APNUM.2014.09.005MaRDI QIDQ465134zbMATH OpenOpenAlexFDO

Authors Terence J. T. Norton, Adrian T. Hill

Publication date 31 October 2014

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL http://opus.bath.ac.uk/45911/1/resubmission_LF.pdf

zbMATH Keywords

cubic Schrödinger equationEuler equationHamiltonian systemleapfrog methodnumerical exampleparasitismsolitonstarting method

Mathematics Subject Classification ID

Particular ordinary differential operators (Dirac, one-dimensional Schrödinger, etc.) (34L40) Completely integrable finite-dimensional Hamiltonian systems, integration methods, integrability tests (37J35) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for Hamiltonian systems including symplectic integrators (65P10)

Recommendations

• The LFOPC leap-frog algorithm for constrained optimization
• A leapfrog multigrid algorithm for the optimal control of parabolic PDEs with Robin boundary conditions
• Leapfrog for Optimal Control
• The control of parasitism in \(G\)-symplectic methods
• On the problem of starting points for iterative methods
• An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
• A leapfrog semi-smooth Newton-multigrid method for semilinear parabolic optimal control problems
• Generalized Leapfrog Methods
• scientific article; zbMATH DE number 2199634
• A note on the choice of control parameters in fullstep iterative processes

Cites work

• Conservation of integrals and symplectic structure in the integration of differential equations by multistep methods
• Dealing with Parasitic Behaviour in G-Symplectic Integrators
• Fehlerabschätzungen bei Differenzenmethoden zur numerischen Integration gewöhnlicher Differentialgleichungen
• G-symplecticity implies conjugate-symplecticity of the underlying one-step method
• Geometric Numerical Integration
• scientific article; zbMATH DE number 4041188 (Why is no real title available?)
• scientific article; zbMATH DE number 4062501 (Why is no real title available?)
• Numerical Methods for Ordinary Differential Equations
• On Extrapolation Algorithms for Ordinary Initial Value Problems
• On the Instability of Leap-Frog and Crank-Nicolson Approximations of a Nonlinear Partial Differential Equation
• Stability of the leapfrog/midpoint method
• Studies in Numerical Nonlinear Instability I. Why do Leapfrog Schemes Go Unstable?
• Studies in Numerical Nonlinear Instability III: Augmented Hamiltonian Systems
• Studies in numerical nonlinear instability. II. A new look at \(u_ t+uu_ x=0\)
• Symmetric general linear methods
• Symplectic methods for the Ablowitz–Ladik discrete nonlinear Schrödinger equation

Cited in

(3)

• Stability of the leapfrog/midpoint method
• Leapfrog variants of iterative methods for linear algebraic equations
• Leap frog integrator modifications in highly collisional particle-in-cell codes

This page was built for publication: An iterative starting method to control parasitism for the Leapfrog method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465134)