An efficient algorithm for the parallel solution of high-dimensional differential equations
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2010
- DOI:
- 10.48550/arXiv.1003.5238
- arXiv:
- arXiv:1003.5238
- Bibcode:
- 2010arXiv1003.5238K
- Keywords:
-
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing;
- Mathematics - Numerical Analysis
- E-Print:
- doi:10.1016/j.cam.2010.12.026