Efficient parallel predictor-corrector methods (Q1902088): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Jacques J. B. de Swart / rank | |||
Property / author | |||
Property / author: Jacques J. B. de Swart / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: RODAS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4725642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3779682 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Block Runge-Kutta Methods on Parallel Computers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel predictor-corrector methods / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0168-9274(95)00061-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2132707983 / rank | |||
Normal rank |
Latest revision as of 12:09, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient parallel predictor-corrector methods |
scientific article |
Statements
Efficient parallel predictor-corrector methods (English)
0 references
30 June 1996
0 references
A class of parallel predictor-corrector methods for non-stiff problems introduced by the author and other co-workers in a previous paper is re-examined. The methods are a class of general linear methods, including Adams-Bashforth-Radau methods in particular. A modification to the methods is derived which increases the stage order and leads to improved convergence characteristics and stability. The improved methods can be implemented in a parallel environment at no extra cost. The numerical tests show a speedup of about 3.1 over a good sequential Runge-Kutta code.
0 references
Runge-Kutta methods
0 references
comparison of methods
0 references
parallel predictor-corrector methods
0 references
linear methods
0 references
Adams-Bashforth-Radau methods
0 references
convergence
0 references
stability
0 references
numerical tests
0 references