Parallel Algorithms for LQ Optimal Control of Discrete-Time Periodic Linear Systems
✍ Scribed by Peter Benner; Ralph Byers; Rafael Mayo; Enrique S Quintana-Ortı́; Vicente Hernández
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 174 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
This paper analyzes the performance of two parallel algorithms for solving the linear-quadratic optimal control problem arising in discrete-time periodic linear systems. The algorithms perform a sequence of orthogonal reordering transformations on formal matrix products associated with the periodic linear system and then employ the so-called matrix disk function to solve the resulting discrete-time periodic algebraic Riccati equations needed to determine the optimal periodic feedback. We parallelize these solvers using two different approaches, based on a coarse-grain and a medium-grain distribution of the computational load. The experimental results report the high performance and scalability of the parallel algorithms on a Beowulf cluster.
📜 SIMILAR VOLUMES
## Abstract The relationship between the spectral radius and the decay rate for discrete stochastic systems is investigated. Several equivalent conditions are obtained, which guarantee a specified decay rate of the closed‐loop systems. Based on the relationship, this paper provides a design method
This paper considers the problem of constructing a controller which quadratically stabilizes an uncertain system and minimizes a guaranteed cost bound on a quadratic cost function. The solution is obtained via a parameter-dependent linear matrix inequality problem.
This paper presents two parallel asynchronous algorithms for the solution of the optimal control problem of linear large-scale dynamic systems. These algorithms are based on the prediction concept. The first one adopts the interaction prediction approach and the second is based upon the costate pred