H∞ model matching problem for singularly perturbed systems
✍ Scribed by Hossein M. Oloomi; Mahmoud E. Sawan
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 1012 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0005-1098
No coin nor oath required. For personal study only.
✦ Synopsis
The model matching problem for single-input single-output singularly perturbed systems is considered. Two sets of sufficient conditions are obtained to guarantee the existence of a two-frequency-scale solution: one for the optimal and one for a suboptimal case. Both the minimum-phase and the non-minumum-phase cases are treated.
The sub-optimal two-frequency-scale solution constructed in this paper uses the solutions of two well-defined lower-order problems, and therefore it is numerically better conditioned and computationally less demanding than the traditional optimal methods. A two-stage algorithm for the computation of the suboptimal TFS solution is presented.
📜 SIMILAR VOLUMES
## Abstract State space solutions for __H__∞ control are formulated for composite state feedback control of singularly perturbed systems. Scaled frequency domain realizations of dynamic systems are developed and used to generate __H__∞ solutions that approach the __H__~2~ solution as an __H__∞‐norm
In the present paper, we prove that the optimal cost of a Mayer's problem for a control system with singular perturbation does converge to the optimal cost of a Mayer's problem associated with control system obtained by averaging. The main novelty of our result lies on the fact that we did not requi
In this paper, we consider the problem of finite-time H -optimal control of linear, singularly perturbed, discrete-time systems. The problem is addressed from the game theoretic approach. This leads to a singularly perturbed, matrix Riccati difference equation, the solution of which is given in term
This article deals with iterative algorithms for domain decomposition applied to the solution of a singularly perturbed parabolic problem. These algorithms are based on finite difference domain decomposition methods and are suitable for parallel computing. Convergence properties of the algorithms ar