Abstract
There is no natural parallelism across time in ODEs, so to exploit massive parallelism for a small system of equations it is necessary to use iterative techniques in time, such as waveform. The Picard method, for example, allows each integration to be performed in O(log N) time over N time steps but its convergence is poor for any but almost quadrature problems (∂f∂y small). Generalized Picard, or waveform, may have much faster convergence but less parallelism. This paper considers parallelism across time, explores a proposal made in an earlier paper [2], and reports on some tests made on that method.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 45-68 |
| Number of pages | 24 |
| Journal | Applied Numerical Mathematics |
| Volume | 11 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Jan 1993 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Numerical Analysis
- Computational Mathematics
- Applied Mathematics
Keywords
- Differential equations
- initial value problems
Fingerprint Dive into the research topics of 'Parallelism across time in ODEs'. Together they form a unique fingerprint.
Cite this
Gear, C. W., & Xuhai, X. (1993). Parallelism across time in ODEs. Applied Numerical Mathematics, 11(1-3), 45-68. https://doi.org/10.1016/0168-9274(93)90039-T