Efficient block predictor-corrector methods with a small number of corrections

Burrage K. (1993) Efficient block predictor-corrector methods with a small number of corrections. Journal of Computational and Applied Mathematics, 45 1-2: 139-150. doi:10.1016/0377-0427(93)90270-L


Author Burrage K.
Title Efficient block predictor-corrector methods with a small number of corrections
Journal name Journal of Computational and Applied Mathematics   Check publisher's open access policy
ISSN 0377-0427
Publication date 1993-04-08
Sub-type Article (original research)
DOI 10.1016/0377-0427(93)90270-L
Open Access Status Not yet assessed
Volume 45
Issue 1-2
Start page 139
End page 150
Total pages 12
Subject 2604 Applied Mathematics
2605 Computational Mathematics
2612 Numerical Analysis
Abstract Recently, various classes of predictor-corrector methods have been proposed as being suitable for solving nonstiff ordinary differential equations in a parallel environment. This paper shows that methods based on a low-order predictor and a Runge-Kutta corrector are not efficient and that if predictor-corrector methods are to be used efficiently for solving nonstiff problems in parallel, then high-order predictors are required. Examples of methods with high-order predictors are given and their efficiency properties are studied in terms of stability and local error theory.
Keyword Block methods
efficiency
parallel
prediction-correction
Q-Index Code C1
Institutional Status Unknown

Document type: Journal Article
Sub-type: Article (original research)
Collection: Scopus Import - Archived
 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 33 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Tue, 13 Sep 2016, 10:26:24 EST by System User