Parallel methods for integrating ordinary differential equations

Authors:
J. Nievergelt
Affiliations:
Univ. of Illinois, Urbana
Venue:
Communications of the ACM
Year:
1964

Citing 0
Cited 13

Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Methods for the Numerical Solution of Ordinary Differential Equations

IEEE Transactions on Computers
Explicit parallel processing description and control in programs for multi- and uni-processor computers

AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Static Analysis of Concurrent Programs Using Ordinary Differential Equations

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
An Improvement of Software Architecture Verification

Electronic Notes in Theoretical Computer Science (ENTCS)
Evaluation of redundancy in a parallel algorithm

IBM Systems Journal
Parallelization in time of numerical simulations of fully-developed plasma turbulence using the parareal algorithm

Journal of Computational Physics
Parallelism and Array Processing

IEEE Transactions on Computers
Parallel High-Order Integrators

SIAM Journal on Scientific Computing
Analysis of Block Parareal Preconditioners for Parabolic Optimal Control Problems

SIAM Journal on Scientific Computing
Checking system boundedness using ordinary differential equations

Information Sciences: an International Journal
A new approach for solving evolution problems in time-parallel way

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
A massively space-time parallel N-body solver

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

Quantified Score

Hi-index	48.23

Visualization

Abstract

This paper is dedicated to the proposition that, in order to take full advantage for real-time computations of highly parallel computers as can be expected to be available in the near future, much of numerical analysis will have to be recast in a more “parallel” form. By this is meant that serial algorithms ought to be replaced by algorithms which consist of several subtasks which can be computed without knowledge of the results of the other subtasks. As an example, a method is proposed for “parallelizing” the numerical integration of an ordinary differential equation, which process, by all standard methods, is entirely serial.