| dc.contributor.author |
Cong, N.H. |
|
| dc.date.accessioned |
2011-05-06T08:37:13Z |
|
| dc.date.available |
2011-05-06T08:37:13Z |
|
| dc.date.issued |
1995 |
|
| dc.identifier.citation |
Volume: 8 Issue: 2 Page : 85-90 |
vi |
| dc.identifier.issn |
8939659 |
|
| dc.identifier.uri |
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6879 |
|
| dc.description.abstract |
In this paper, we propose a fast convergence parallel iteration process for solving a low-order
implicit Runge-Kutta-Nystr??m method. The resulting scheme can be regarded as a parallel singly
diagonally implicit Runge-Kutta-Nystr??m (PDIRKN) method. On a two-processor computer, this parallel
method requires effectively two sequential implicit stages per step. By numerical experiments applied to
initial-boundary-value problems for semi-discrete partial differential equations (PDEs), we compare this
method with some sequential DIRKN methods from the literature, and show its efficiency in a low-accuracy
range which is realistic for these problems. ?? 1995. |
vi |
| dc.language.iso |
en |
vi |
| dc.publisher |
Applied Mathematics Letters |
vi |
| dc.subject |
Parallelism |
vi |
| dc.subject |
Predictor-corrector methods |
vi |
| dc.title |
A fast convergence parallel DIRKN method and its applications to PDEs |
vi |
| dc.type |
Article |
vi |