2008
DOI: 10.1007/s10444-008-9067-6
|View full text |Cite
|
Sign up to set email alerts
|

Legendre–Gauss collocation methods for ordinary differential equations

Abstract: In this paper, we propose two efficient numerical integration processes for initial value problems of ordinary differential equations. The first algorithm is the Legendre-Gauss collocation method, which is easy to be implemented and possesses the spectral accuracy. The second algorithm is a mixture of the collocation method coupled with domain decomposition, which can be regarded as a specific implicit Legendre-Gauss Runge-Kutta method, with the global convergence and the spectral accuracy. Numerical results d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
51
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 65 publications
(60 citation statements)
references
References 24 publications
0
51
0
Order By: Relevance
“…The fully discrete version of (12) is obtained by discretizing (15) or equivalently (18) in time using the SBP-SAT technique. The use of the Kronecker product rules (21)(22)(23) and (19) yield…”
Section: The Fully Discrete Energy Estimatementioning
confidence: 99%
See 1 more Smart Citation
“…The fully discrete version of (12) is obtained by discretizing (15) or equivalently (18) in time using the SBP-SAT technique. The use of the Kronecker product rules (21)(22)(23) and (19) yield…”
Section: The Fully Discrete Energy Estimatementioning
confidence: 99%
“…In global methods, the whole time interval from zero to the final time T is considered. Global methods using collocation and spectral approximations have been considered previously (see [13], [14], [15], [16]) but have often been considered unpractical. However, the unconditional stability in combination with the very high accuracy cannot be matched by the local methods.…”
Section: Introductionmentioning
confidence: 99%
“…Remark 2 We can also use (19) and (20) to evaluate the values of u N (t N β,k ). By (2.16) of [25], we know t N β,N ∼ = 4β −1 N. Thus, we obtain the values of the numerical solution at the large interpolation nodes, even for the moderate mode N .…”
Section: Laguerre-gauss Collocation Methodsmentioning
confidence: 99%
“…When f (z 1 , z 0 , t) is nonlinear, we can use a certain iteration process to solve (19) and obtain u N β,l (0 l N + 2). It is shown in the last part of Appendix A of this paper that, if some conditions are fulfilled, then the related iteration is convergent.…”
Section: Laguerre-gauss Collocation Methodsmentioning
confidence: 99%
See 1 more Smart Citation