An efficient algorithm for the parallel solution of high-dimensional differential equations

DOI10.1016/J.CAM.2010.12.026zbMATH Open1210.65145OpenAlexW2950064713MaRDI QIDQ631906FDOQ631906

Authors Stefan Klus, Tuhin Sahai, Cong Liu, Michael Dellnitz

Publication date 14 March 2011

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1003.5238

zbMATH Keywords

numerical examplesgraph partitioningparallel algorithmsPetri netswaveform relaxationadaptive windowinghigh-dimensional differential-algebraic equations

Mathematics Subject Classification ID

Numerical methods for differential-algebraic equations (65L80) Parallel numerical computation (65Y05) Implicit ordinary differential equations, differential-algebraic equations (34A09) Numerical methods for initial value problems involving ordinary differential equations (65L05)

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.

Recommendations

• A partitioning algorithm for the parallel solution of differential-algebraic equations by waveform relaxation
• Parallel tensor methods for high-dimensional linear PDEs
• scientific article; zbMATH DE number 66107
• Numerical solution of parabolic equations in high dimensions
• Efficient Parallel Algorithms for Solving Initial-Boundary Value and Time-Periodic Parabolic Partial Differential Equations

Cites work

• scientific article; zbMATH DE number 1942408 (Why is no real title available?)
• scientific article; zbMATH DE number 1821102 (Why is no real title available?)
• scientific article; zbMATH DE number 763717 (Why is no real title available?)
• scientific article; zbMATH DE number 790009 (Why is no real title available?)
• scientific article; zbMATH DE number 2212009 (Why is no real title available?)
• A technique of state space search based on unfolding
• Algorithmic Challenges in Web Search Engines
• Dimension reduction of large-scale systems. Proceedings of a workshop, Oberwolfach, Germany, October 19--25, 2003.
• Estimating Waveform Relaxation Convergence
• Hearing the clusters of a graph: A distributed algorithm
• Interpolants and Symbolic Model Checking
• MODEL REDUCTION FOR FLUIDS, USING BALANCED PROPER ORTHOGONAL DECOMPOSITION
• Spectra and Pseudospectra of Waveform Relaxation Operators
• Turbulence, Coherent Structures, Dynamical Systems and Symmetry
• Waveform relaxation as a dynamical system
• Waveform relaxation for linear RC-circuits

Cited in

(7)

• Spectral complexity of directed graphs and application to structural decomposition
• On nonintrusive uncertainty quantification and surrogate model construction in particle accelerator modeling
• Polynomial chaos based uncertainty quantification in Hamiltonian, multi-time scale, and chaotic systems
• scientific article; zbMATH DE number 5225348 (Why is no real title available?)
• Hearing the clusters of a graph: A distributed algorithm
• Dynamical Systems Theory and Algorithms for NP-hard Problems
• A high-order parallel finite difference algorithm

Describes a project that uses

Uses Software

• mctoolbox
• Eigtool

This page was built for publication: An efficient algorithm for the parallel solution of high-dimensional differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q631906)