A Parallel Decoupling Technique to Accelerate Convergence of Relaxation Solutions of Integral-Differential-Algebraic Equations

In this paper, we first study the covergence performance of relaxatio-based algorithms for linear integral differential-algebraic equations (IDAEs), then a parallel decoupling technique to speed up the convergence of the relaxation-based algorithms is derived. This novel technique is suitable for implementation of parallel processing for complicated systems of IDAEs. Factors taking effect on the performance of parallel processing are discussed in detail. Large numerical examples running on a network of IBM RS/6000 SP2 system are given to illustrate how judicious partitionings of matrices can help improve convergence in parallel processing.