### 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 language | English |
---|---|

Pages | 2217-2222 |

Number of pages | 6 |

Publication status | Published - 1 Dec 1989 |

Externally published | Yes |

Event | Proceedings of the 1989 American Control Conference - Pittsburgh, PA, USA Duration: 21 Jun 1989 → 23 Jun 1989 |

### Other

Other | Proceedings of the 1989 American Control Conference |
---|---|

City | Pittsburgh, PA, USA |

Period | 21/6/89 → 23/6/89 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*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, .

**Fast parallel iterative aggregation methods for simulation of dynamical systems.** / Tsai, Wei K.; Huang, Garng Morton; Wei, Lu.

Research output: Contribution to conference › Paper

}

TY - CONF

T1 - Fast parallel iterative aggregation methods for simulation of dynamical systems

AU - Tsai, Wei K.

AU - Huang, Garng Morton

AU - Wei, Lu

PY - 1989/12/1

Y1 - 1989/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024926210&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024926210&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0024926210

SP - 2217

EP - 2222

ER -