arXiv Analytics

Sign in

arXiv:1304.6508 [math.NA]AbstractReferencesReviewsResources

Theoretical analysis of Sinc-collocation methods and Sinc-Nyström methods for initial value problems

Tomoaki Okayama

Published 2013-04-24Version 1

A Sinc-collocation method has been proposed by Stenger, and he also gave theoretical analysis of the method in the case of a `scalar' equation. This paper extends the theoretical results to the case of a `system' of equations. Furthermore, this paper proposes more efficient method by replacing the variable transformation employed in Stenger's method. The efficiency is confirmed by both of theoretical analysis and numerical experiments. In addition to the existing and newly-proposed Sinc-collocation methods, this paper also gives similar theoretical results for Sinc-Nystr\"{o}m methods proposed by Nurmuhammad et al. From a viewpoint of the computational cost, it turns out that the newly-proposed Sinc-collocation method is the most efficient among those methods.

Comments: Keywords: Sinc approximation, Sinc indefinite integration, differential equation, Volterra integral equation, tanh transformation, double-exponential transformation
Categories: math.NA, cs.NA
Subjects: 65L05, 65R20, 65D30
Related articles: Most relevant | Search more
arXiv:0811.2481 [math.NA] (Published 2008-11-15)
A Phase-Fitted Runge-Kutta-Nyström method for the Numerical Solution of Initial Value Problems with Oscillating Solutions
arXiv:2111.04863 [math.NA] (Published 2021-11-08)
Adaptive solution of initial value problems by a dynamical Galerkin scheme
arXiv:2301.03920 [math.NA] (Published 2023-01-10)
Recursive Solution of Initial Value Problems with Temporal Discretization