The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2017
DOI: 10.1016/j.apnum.2017.04.008
|View full text |Cite
|
Sign up to set email alerts
|

Efficient implementation of RKN-type Fourier collocation methods for second-order differential equations

Abstract: In this paper we discuss the efficient implementation of RKN-type Fourier collocation methods, which are used when solving second-order differential equations. The proposed implementation relies on an alternative formulation of the methods and the blended formulation. The features and effectiveness of the implementation are confirmed by the performance of the methods on two numerical tests.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 53 publications
(35 citation statements)
references
References 24 publications
0
35
0
Order By: Relevance
“…To show the efficiency and robustness of the triangular splitting implementation, the iterations we select for comparison are: TRKNTCM1: the above method using Algorithm 3.4 with 1 inner iteration; TRKNTCM2: the above method using Algorithm 3.4 with 2 inner iterations; TRKNTCM3: the above method using Algorithm 3.4 with 3 inner iterations; FPRKNTCM: the above method using fixed‐point iteration; SNRKNTCM: the above method using simplified‐Newton iteration; ERKNTCM: the above method using the efficient algorithm given by Table 3 in Wang et al …”
Section: Numerical Testsmentioning
confidence: 99%
“…To show the efficiency and robustness of the triangular splitting implementation, the iterations we select for comparison are: TRKNTCM1: the above method using Algorithm 3.4 with 1 inner iteration; TRKNTCM2: the above method using Algorithm 3.4 with 2 inner iterations; TRKNTCM3: the above method using Algorithm 3.4 with 3 inner iterations; FPRKNTCM: the above method using fixed‐point iteration; SNRKNTCM: the above method using simplified‐Newton iteration; ERKNTCM: the above method using the efficient algorithm given by Table 3 in Wang et al …”
Section: Numerical Testsmentioning
confidence: 99%
“…Consequently, all possible Casimirs and the Hamiltonian H are conserved quantities for (50). In the sequel, we show that EQUIP methods can be conveniently used for solving such problems.…”
Section: Poisson Problemsmentioning
confidence: 99%
“…(28,48,50) 3.24 1800 11.1 2.25 × 10 −10 4.44 × 10 −16 (28,47,49) 3.49 1900 10.5 2.20 × 10 −10 4.44 × 10 −16 (27,45,47) 3.59 2000 10.0 2.89 × 10 −10 3.33 × 10 −16 (26,44,46) 3.46…”
Section: Highly Oscillatory Problemsmentioning
confidence: 99%
See 2 more Smart Citations