Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 10 (1999), S. 115-133 
    ISSN: 1572-9044
    Keywords: Runge–Kutta–Nyström methods ; predictor–corrector methods ; stability ; parallelism ; 65M12 ; 65M20
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes the construction of block predictor–corrector methods based on Runge–Kutta–Nyström correctors. Our approach is to apply the predictor–corrector method not only with stepsize h, but, in addition (and simultaneously) with stepsizes a i h, i = 1 ...,r. In this way, at each step, a whole block of approximations to the exact solution at off‐step points is computed. In the next step, these approximations are used to obtain a high‐order predictor formula using Lagrange or Hermite interpolation. Since the block approximations at the off‐step points can be computed in parallel, the sequential costs of these block predictor–corrector methods are comparable with those of a conventional predictor–corrector method. Furthermore, by using Runge–Kutta–Nyström corrector methods, the computation of the approximation at each off‐step point is also highly parallel. Numerical comparisons on a shared memory computer show the efficiency of the methods for problems with expensive function evaluations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...