2020
DOI: 10.1137/18m1209453
|View full text |Cite
|
Sign up to set email alerts
|

On Leapfrog-Chebyshev Schemes

Abstract: This paper is dedicated to the improvement of the efficiency of the leap-frog method for second order differential equations. In numerous situations the strict CFL condition of the leapfrog method is the main bottleneck that thwarts its performance. Based on Chebyshev polynomials new methods have been constructed that exhibit a much weaker CFL condition than the leap-frog method. However, these methods do not even approximately conserve the energy of the exact solution which can result in a bad approximation q… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 12 publications
(23 citation statements)
references
References 20 publications
0
23
0
Order By: Relevance
“…We prove the equivalence of definition (2.22) and the algorithm in section 2.4 by using the following recursion for P ∆t p,ν , which is also noticed in [5].…”
Section: Appendix a Estimates For Chebyshev Polynomialsmentioning
confidence: 67%
See 3 more Smart Citations
“…We prove the equivalence of definition (2.22) and the algorithm in section 2.4 by using the following recursion for P ∆t p,ν , which is also noticed in [5].…”
Section: Appendix a Estimates For Chebyshev Polynomialsmentioning
confidence: 67%
“…Remark A.3. Let it be noted that some of the estimates of the following Lemmas A.4 and A.5 are also proven in [5]. More specifically, (A.8a) is proven in […”
Section: Appendix a Estimates For Chebyshev Polynomialsmentioning
confidence: 97%
See 2 more Smart Citations
“…We remark, however, since the minimum size of the mesh h min is smaller for a well resolved mesh, the computation is more expensive as the result of smaller time step due to the CFL condition. One possible remedy, which deserves further investigation, is the methods of local time stepping for which we refer to the recent works Carle et al [7], Grote et al [19] and the references therein.…”
Section: Numerical Examplesmentioning
confidence: 99%