1977
DOI: 10.1016/0898-1221(77)90097-9
|View full text |Cite
|
Sign up to set email alerts
|

Optimally stable parallel predictors for Adams—Moulton correctors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

1981
1981
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…11. This study indicated that the more stable predictor form is obtained by shifting the predictor to the right, i.e., from n − 1 to n. This approximately restores the original AB's formulation.…”
Section: Parallelizing the Predictor-corrector Methodsmentioning
confidence: 61%
See 1 more Smart Citation
“…11. This study indicated that the more stable predictor form is obtained by shifting the predictor to the right, i.e., from n − 1 to n. This approximately restores the original AB's formulation.…”
Section: Parallelizing the Predictor-corrector Methodsmentioning
confidence: 61%
“…The computers have to exchange information after the predictor equation to construct the term F p n+1 and F p n+2 on the right of Eqs. (11). PBM and PPM represent an interesting contrast.…”
Section: Block Methodsmentioning
confidence: 99%
“…From a stability point of view, this algorithm should not behave markedly differently between a serial or parallel implementation, unlike algorithms of the predictor-corrector type where it has been shown [Katz et al, 1977] that the stability interval for a fourth order parallel predictor-corrector algorithm is about 0.846 as compared with 1.285 for the fourth-order serial Adams-Bashforth, Adams-Moulton pair. The reason there is that in the parallel case the predictor and corrector equations are spread over two different time steps.…”
Section: Error and Stability Questionsmentioning
confidence: 93%
“…problem is typical of the test differential equations used byKatz, Franklin and Sen [1977] to test the error and stability properties of parallel algorithms.…”
mentioning
confidence: 99%
“…is means that, at any point, we can find the solution numerically using any number of the previous points. e Adams-Moulton method [62,63,65,66] is a modification of the Adams-Bashforth method, which was Fractional tumor cells kill by chemotherapy [40,42].…”
Section: Methods Of Solutionmentioning
confidence: 99%