Publication Details
Title: Fast and Efficient Parallel Algorithms for Problems in Control Theory
Author: B. Codenotti, B. N. Datta, K. Datta, and M. Leoncini
Group: ICSI Technical Reports
Date: August 1994
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1994/tr-94-025.pdf
Overview:
Remarkable progress has been made in both theory and applications of all important areas of control. On the other hand, progress in computational aspects of control theory, especially in the area of large-scale and parallel computations, has been painfully slow. In this paper we address some central problems arising in control theory, namely the controllability and the eigenvalue assignment problems, and the solution of the Lyapunov and Sylvester observer matrix equations. For all these problems we give parallel algorithms that run in almost linear time on a Parallel Random Access Machine model. The algorithms make efficient use of the processors and are scalable, which makes them of practical worth also in the case of limited parallelism. Keywords: parallel algorithms, linear algebra, control theory, controllability, eigenvalue assignment, Lyapunov equation, Sylvester equation
Bibliographic Information:
ICSI Technical Report TR-94-025
Bibliographic Reference:
B. Codenotti, B. N. Datta, K. Datta, and M. Leoncini. Fast and Efficient Parallel Algorithms for Problems in Control Theory. ICSI Technical Report TR-94-025, August 1994
Author: B. Codenotti, B. N. Datta, K. Datta, and M. Leoncini
Group: ICSI Technical Reports
Date: August 1994
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1994/tr-94-025.pdf
Overview:
Remarkable progress has been made in both theory and applications of all important areas of control. On the other hand, progress in computational aspects of control theory, especially in the area of large-scale and parallel computations, has been painfully slow. In this paper we address some central problems arising in control theory, namely the controllability and the eigenvalue assignment problems, and the solution of the Lyapunov and Sylvester observer matrix equations. For all these problems we give parallel algorithms that run in almost linear time on a Parallel Random Access Machine model. The algorithms make efficient use of the processors and are scalable, which makes them of practical worth also in the case of limited parallelism. Keywords: parallel algorithms, linear algebra, control theory, controllability, eigenvalue assignment, Lyapunov equation, Sylvester equation
Bibliographic Information:
ICSI Technical Report TR-94-025
Bibliographic Reference:
B. Codenotti, B. N. Datta, K. Datta, and M. Leoncini. Fast and Efficient Parallel Algorithms for Problems in Control Theory. ICSI Technical Report TR-94-025, August 1994