2001
DOI: 10.1029/2000rs002503
|View full text |Cite
|
Sign up to set email alerts
|

High‐order, leapfrog methodology for the temporally dependent Maxwell's equations

Abstract: Abstract.A high-order, leapfrog integrator is presented and analyzed for Maxwell's time domain equations. The integrator is shown to be quite robust in terms of its efficiency and memory demands. Moreover, the integrator retains the original simplicity of the traditional second-order, leapfrog integrator. Rigorous Fourier analyses are presented to quantify the dispersion, dissipation, and stability properties of the integrator. To limit the scope of the presentation, the 2x2, 2x4, 4x2, and 4x4 schemes are exam… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2002
2002
2015
2015

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…In an attempt to offer an alternative to Runge-Kutta schemes, we shall use family of high-order explicit leap-frog (LF) schemes originally proposed by Young [21]. The chief attributes of these integrators are that the memory requirements are small and the algorithmic complexity is not significantly increased, with respect to the second-order leap-fi"og scheme.…”
Section: Time Discretizationmentioning
confidence: 99%
“…In an attempt to offer an alternative to Runge-Kutta schemes, we shall use family of high-order explicit leap-frog (LF) schemes originally proposed by Young [21]. The chief attributes of these integrators are that the memory requirements are small and the algorithmic complexity is not significantly increased, with respect to the second-order leap-fi"og scheme.…”
Section: Time Discretizationmentioning
confidence: 99%
“…Note that linear combinations (12) are still valid with superscripts. According to Young [62], the leap-frog integration scheme with an order N (even) is written:…”
Section: High-order Leap-frog Schemementioning
confidence: 99%
“…Indeed, unlike the ADER method that has the same level of accuracy in space and time, the standard leap-frog time scheme, second-order accurate, reduces the global convergence order limiting the interest for high-order space discretizations. Then, we propose an extension of the leap-frog scheme to higher (even) orders of accuracy, following a method proposed for the Maxwell equations by Young [62] and applied in the DG context by Fahs [29]. This method allows us to achieve temporal accuracy to any even order desired, when free surface conditions are applied, by introducing an iterative procedure.…”
Section: Introductionmentioning
confidence: 99%
“…But, since it is second order accurate, the global accuracy of the scheme INRIA can be penalized by the time approximation when higher-degree polynomials (m > 2) are used for spatial approximation. Then, we propose a higher-order leap-frog scheme following the method, proposed for the Maxwell equations, by Young [16] or Spachmann et al [14] and applied to a discontinuous Galerkin method by Fahs [4]. For a detailed description of the method, we introduce a simplified two equations problem whose unknowns are v(x, t) and σ(x, t)…”
Section: Time Discretizationmentioning
confidence: 99%
“…According to the first results of the method presented in [3], the time accuracy of the scheme is crucial when global high-order accuracy is required. Then, we propose an extension of the leap-frog scheme to higher orders of accuracy following a method proposed for the Maxwell equations by Young [16] or Spachmann et al [14] and applied to DG methods by Fahs [4]. This method allows us to achieve temporal accuracy to any even order desired by introducing an iterative procedure.…”
Section: Introductionmentioning
confidence: 99%