Hybrid dynamic iterations for the solution of initial value problems

Many scientific problems are posed as Ordinary Differential Equations (ODEs). A large subset of these are initial value problems, which are typically solved numerically. The solution starts by using a known state space of the ODE system to determine the state at a subsequent point in time. This process is repeated several times. When the computational demand is high due to large state space, parallel computers can be used efficiently to reduce the time to solution. Conventional parallelization strategies distribute the state space of the problem amongst cores and distribute the task of computing for a single time step amongst the cores. They are not effective when the computational problems have fine granularity, for example, when the state space is relatively small and the computational effort arises largely from the long time span of the initial value problem. We propose a hybrid dynamic iterations method which combines conventional sequential ODE solvers with dynamic iterations to parallelize the time domain. Empirical results demonstrate a factor of two to four improvement in performance of the hybrid dynamic iterations method over a conventional ODE solver on an 8 core processor. Compared to Picard iterations (also parallelized in the time domain), the proposed method shows better convergence and speedup results when high accuracy is required.

[1]  Alberto L. Sangiovanni-Vincentelli,et al.  The Waveform Relaxation Method for Time-Domain Analysis of Large Scale Integrated Circuits , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Morten Bjørhus,et al.  A note on the convergence of discretized dynamic iteration , 1995 .

[3]  Yanan Yu,et al.  Application of Reduce Order Modeling to Time Parallelization , 2005, HiPC.

[4]  Muruhan Rathinam,et al.  Dynamic Iteration Using Reduced Order Models: A Method for Simulation of Large Scale Modular Systems , 2002, SIAM J. Numer. Anal..

[5]  Stefan Vandewalle,et al.  On dynamic iteration methods for solving time-periodic differential equations , 1993 .

[6]  Ashok Srinivasan,et al.  Latency tolerance through parallelization of time in scientific applications , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[7]  O. Nevanlinna Remarks on Picard-Lindelöf iteration , 1989 .

[8]  Alexander Ostermann,et al.  Multi-grid dynamic iteration for parabolic equations , 1987 .

[9]  Yanan Yu,et al.  Dynamic iterations for the solution of ordinary differential equations on multicore processors , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[10]  H. Grotstollen,et al.  Fast time-domain simulation by waveform relaxation methods , 1996, PESC Record. 27th Annual IEEE Power Electronics Specialists Conference.

[11]  Yanan Yu,et al.  Scalable Time-Parallelization of Molecular Dynamics Simulations in Nano Mechanics , 2006, 2006 International Conference on Parallel Processing (ICPP'06).

[12]  Rolf Jeltsch,et al.  Waveform Relaxation with Overlapping Splittings , 1995, SIAM J. Sci. Comput..

[13]  Ismail K. Youssef,et al.  Picard iteration algorithm combined with Gauss-Seidel technique for initial value problems , 2007, Appl. Math. Comput..

[14]  Charles William Gear Waveform methods for space and time parallelism , 1991 .

[15]  Benedict J. Leimkuhler Estimating Waveform Relaxation Convergence , 1993, SIAM J. Sci. Comput..

[16]  Yvon Maday,et al.  Parallel in time algorithms for quantum control: Parareal time discretization scheme , 2003 .

[18]  Y Maday,et al.  Parallel-in-time molecular-dynamics simulations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  L. Shampine,et al.  Numerical Solution of Ordinary Differential Equations. , 1995 .

[20]  T. E. Hull,et al.  Comparing Numerical Methods for Ordinary Differential Equations , 1972 .