2007
DOI: 10.1007/s10543-007-0120-5
|View full text |Cite
|
Sign up to set email alerts
|

Fast Runge–Kutta methods for nonlinear convolution systems of Volterra integral equations

Abstract: In this paper fast implicit and explicit Runge-Kutta methods for systems of Volterra integral equations of Hammerstein type are constructed. The coefficients of the methods are expressed in terms of the values of the Laplace transform of the kernel. These methods have been suitably constructed in order to be implemented in an efficient way, thus leading to a very low computational cost both in time and in space. The order of convergence of the constructed methods is studied. The numerical experiments confirm t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 43 publications
(10 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…We present a brief description of this method in the use of our method; the complete description is available in literature. [47][48][49][50] Using the asymptotic solution s l described in Eq. ͑13͒, the convolution can be separated at time point t c that one chooses so as to suitably converge s l with s l .…”
Section: Fast Convolution Methodsmentioning
confidence: 99%
“…We present a brief description of this method in the use of our method; the complete description is available in literature. [47][48][49][50] Using the asymptotic solution s l described in Eq. ͑13͒, the convolution can be separated at time point t c that one chooses so as to suitably converge s l with s l .…”
Section: Fast Convolution Methodsmentioning
confidence: 99%
“…Actually, there is a wide range of numerical methods available for solving integral equations (see [11] for a comprehensive survey on the subject): iterative methods, wavelet methods [12,13,14,15], generalized Runge-Kutta methods [16,17], or even Monte Carlo methods [18]. Collocation methods [10,19] have proved to be very suitable for a wide range of equations, because of their accuracy, stability and rapid convergence.…”
Section: Introductionmentioning
confidence: 99%
“…In matrix notation the form of the method reads [5,8,16]). In particular, when K (t, η) in (2.4) is of convolution type, a convolution quadrature method [9,13,17] could be appropriate. However, in this case it is necessary to have some knowledge of the Laplace transform of the kernel.…”
Section: Space-time Discretizationmentioning
confidence: 99%