Abstract
Many implicit differential equations (IDEs) modelling practical problems can be partitioned into loosely coupled subsystems. In this paper the objective of the partitioning is to permit the numerical integration of one time step to be performed as the solution of a sequence of small subproblems. This reduces the computational complexity compared to solving one large system and permits efficient parallel execution under appropriate conditions. The subsystems are integrated using methods based on low order backward differentiation formulas. This paper presents an adaptive partitioning algorithm based on a classical graph algorithm and techniques for the efficient evaluation of the error introduced by the partitioning. The power of the adaptive partitioning algorithm is demonstrated by a variable step-size integration algorithm which solves an implicit system of differential equations modelling a 32 bit carry look-ahead adder circuit.
| Original language | English |
|---|---|
| Journal | BIT - Numerical Mathematics |
| Volume | 50 |
| Issue number | 2 |
| Pages (from-to) | 405-423 |
| Number of pages | 18 |
| ISSN | 0006-3835 |
| DOIs | |
| Publication status | Published - 1 Jun 2010 |