Abstract
The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further, we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16.
Original language | English |
---|---|
Pages (from-to) | 3053-3062 |
Number of pages | 10 |
Journal | Journal of Computational and Applied Mathematics |
Volume | 235 |
Issue number | 9 |
DOIs | |
Publication status | Published - 1 Mar 2011 |
Keywords
- Adaptive windowing
- Graph partitioning
- Parallel algorithms
- Petri nets
- Waveform relaxation
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics