Fast parallel iterative aggregation methods for simulation of dynamical systems

Wei K. Tsai, Garng Huang, Lu Wei

Research output: Contribution to conferencePaper

Abstract

A novel iterative aggregation algorithm for the numerical simulation of dynamic systems is proposed and analyzed. The algorithm exploits the special structure of the linear equation problem resulting from the discretization of the dynamic system and of the aggregation/disaggregation procedures. The algorithm has a time complexity of (I(q) + 2M(q) + 3)log N in solving linear systems with q states for N discrete-time instants using O(qN) processors, where I(q) is the parallel time complexity for inverting a q × q matrix and M(q) is the parallel time complexity for matrix multiplication of two q × q matrices. The competing parallel cyclic reduction method for the same problem has a time complexity of I(q) + 3M(q) + 4)log N. Thus the proposed algorithm has a definite speed advantage.

Original languageEnglish
Pages2217-2222
Number of pages6
Publication statusPublished - 1 Dec 1989
EventProceedings of the 1989 American Control Conference - Pittsburgh, PA, USA
Duration: 21 Jun 198923 Jun 1989

Other

OtherProceedings of the 1989 American Control Conference
CityPittsburgh, PA, USA
Period21/6/8923/6/89

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tsai, W. K., Huang, G., & Wei, L. (1989). Fast parallel iterative aggregation methods for simulation of dynamical systems. 2217-2222. Paper presented at Proceedings of the 1989 American Control Conference, Pittsburgh, PA, USA, .