Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Datta B., Datta K., Leoncini M. Parallel complexity of some numerical problems in control theory. Internal note IEI-B4-27, 1991.
In this paper we introduce parallel algorithms for two important problems in control theory, namely the controllability and the pole assignment problems. The algorithms can be implemented according to various optimization criteria, i.e. to minimize the parallel time or to maximize the efficiency. Moreover, from an implementation viewpoint, they enjoy the nice property of being solely based on common routines for the basic linear algebra problems.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional