By Topic

Efficient parallel algorithms for controllability and eigenvalue assignment problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Datta, B.N. ; Northern Illinois University, DeKalb, Illinois, USA ; Datta, K.

The design and analysis of time-invariant linear control systems give rise to a variety of interesting linear algebra problems. Numerically viable sequential algorithms now exist for most of these problems; however, efficient parallel algorithms are virtually nonexistent. In this paper, we propose efficient parallel algorithms for multi-input controllability problem and the single-input pole assignment problem. A desirable feature of these algorithms is that they are composed only of basic linear algebraic operations such as vector-matrix multiplication, solution of a linar system and computation of eigenvalues or singular values of a symmetric matrix, for which efficient parallel algorithms have already been developed. Thus, the proposed algorithms have potentials for implementations on some existing and future parallel processors.

Published in:

Decision and Control, 1986 25th IEEE Conference on

Date of Conference:

10-12 Dec. 1986