Fast and Efficient Parallel Algorithms for Problems in Control Theory (original) (raw)
Related papers
A Parallel Algorithm for the Eigenvalue Assignment Problem in Linear Systems
1995
Abstract A parallel algorithm for the eigenvalue assignment problem (EAP) in single-input linear systems is presented. The algorithm is based on solution of the observer matrix equation, and it has a time complexity of 0 (n3/p), where n is the order of the system and p is the number of processors. The algorithm has been implemented on the hypercube parallel computer INTEL iPSC 860, with 8 processors, and expected speed up has been obtained.
A parallel algorithm for the Sylvester observer equation
SIAM Journal on Scientific …, 1996
We present a new algorithm for solving the Sylvester-Observer Equation: AX ? XH = (0;C). The algorithm embodies two main computational phases: the solution of a series of independent equation systems, and a series of matrix-matrix multiplications. The algorithm is, thus, well suited for parallel and high performance computing. By reducingthe coe cient matrix A to lower Hessenberg form, one can implementthe algorithme ciently, with few oating-point operations and little workspace. The algorithm has been succesfully implemented on a Cray C-90. A comparison, both theoretical and experimental, has been made with the well-known Hessenberg-Schur algorithm which solves an arbitrary Sylvester equation. Our theoretical analysis and experimental results con rm the superiority of the proposed algorithm, both in e ciency and speed, over the Hessenberg-Schur algorithm.
Parallel algorithms for certain matrix computations
Theoretical Computer Science, 1997
The complexity of performing matrix computations, such as solving a linear system, inverting a nonsingular matrix or computing its rank, has received a lot of attention by both the theory and the scientific computing communities. In this paper we address some "nonclassical" matrix problems that find extensive applications, notably in control theory. More precisely, we study the matrix equations Ax +XAT = C and Ax -XB = C, the "inverse" of the eigenvalue problem (called pole assignment), and the problem of testing whether the matrix [B AB
Parallel partial stabilizing algorithms for large linear control systems
Journal of Supercomputing, 2000
In this paper we present parallel algorithms for stabilizing large linear control systems on multicomputers. Our algorithms first separate the stable part of the linear control system and then compute a stabilizing feedback for the unstable part. Both stages are solved by means of the matrix sign function which presents a high degree of parallelism and scalability.
Computational methods for linear control systems
Automatica, 1993
Book Reviews practical implications. To solve the problem it is necessary to assume that the desired signal is non-Gaussian and use the higher order statistics of the measured signal. This leads to nonlinear estimation. This part of the book is far outside the scope of the rest of the book and could have been omitted.
Parallel computation of a control algorithm for a robot manipulator
Control Engineering Practice, 1996
The paper considers parallel computation of an adaptive impedance control algorithm for a robot manipulator. Simulation results show that short sampling periods are necessary in order to obtain correct action of the control method. The complex control law is represented as a task graph and scheduled for computation on a network of processors. The method of scheduling is described and measured execution times are presented.
Concurrency and Computation: Practice and Experience, 2007
We discuss the parallelization of an efficient algorithm for the partial stabilization of large-scale linear control systems in generalized state-space form. The algorithm is composed of highly parallel iterative schemes that appear in the computation of certain matrix functions. Here we evaluate different approaches to exploit parallelism at two levels, based on threads and processes. Our experimental results on a cluster of symmetric multiprocessors and a CC-NUMA platform show that the efficiency of the matrix operations underlying the iterative schemes carry over to the parallel implementation of the stabilization algorithm.
On krylov matrices and controllability of n-dimensional linear time-invariant state equations
Journal of Structural Control, 1996
The classical Rosenbrock's algorithm (based on the Gauss elimination method) for n-dimensional linear time invariant state equation matrices is analysed and modernized. The method of orthogonal similarity reduction to block Hessenberg form is used to assure numerical stability. The updated version of the Rosenbrock's algorithm is then justified in a very easy way using properties of Krylov matrices. Additionally, this algorithm can be used to determine an equivalence transformation which converts an n-dimensional linear state equation into a controllable form (or a time invariant one into an equivalent observable form). It is advantageous for big and medium size problems and can be easily parallelized. Numerical examples are presented.
Parallel algorithms for adaptive control: Robust stability
Lecture Notes in Control and Information Sciences
A class of parallel algorithms for adaptive control of siso linear systems is described. The systems considered are assumed to belong to one among a finite number of classes of admissible process models, and each class is robustly stabilizable by some linear time-invariant controller. The control used is chosen in real timefrom among the outputs of a finite set of linear time-invariant candidate controllersby a tuner or supervisor, according to observations of suitably defined "identification errors." The method preserves the robustness properties of the linear control design in an adaptive context. We expect that parallel algorithms of the type discussed here will be useful tools to exploit the compromise between performance of an adaptive control system and the computational power of the hardware in which it is implemented. Another application is to fault-tolerant control.
Special issue on parallel matrix algorithms and applications (PMAA’16)
Parallel Computing, 2018
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.