Partial stabilisation of large-scale discrete-time linear control systems

@article{Benner2005PartialSO,
  title={Partial stabilisation of large-scale discrete-time linear control systems},
  author={Peter Benner and Mar{\'i}a Isabel Castillo and Enrique S. Quintana‐Ort{\'i}},
  journal={Int. J. Comput. Sci. Eng.},
  year={2005},
  volume={1},
  pages={15-21}
}
We propose a parallel algorithm for stabilising large, discrete-time, linear control systems on a Beowulf cluster. Our algorithm first separates the Schur stable part of the linear control system using an inverse free iteration for the matrix disc function and then computes a stabilising feedback matrix for the unstable part. This stage requires the numerical solution of a Stein equation. This linear matrix equation is solved using the sign function method after applying a Cayley transformation… 
Partial Stabilization of Descriptor Systems Using Spectral Projectors
TLDR
A partial stabilization algorithm is suggested which preserves stable poles of the system while the unstable ones are moved to the left half plane using state feedback using the matrix pencil disk function method.

References

SHOWING 1-10 OF 27 REFERENCES
Parallel Partial Stabilizing Algorithms for Large Linear Control Systems
TLDR
These algorithms first separate the stable part of the linear control system and then compute a stabilizing feedback for the unstable part by means of the matrix sign function which presents a high degree of parallelism and scalability.
A stabilization algorithm for linear discrete constant systems
TLDR
The procedure offers a method for constructing a stabilizing feedback without the computational difficulty of raising the unstable open-loop response matrix to powers thus making the method attractive for high order or poorly conditioned systems.
NUMERICAL SOLUTION OF DISCRETE STABLE LINEAR MATRIX EQUATIONS ON MULTICOMPUTERS
TLDR
This work investigates the parallel performance of numerical algorithms for solving discrete Sylvester and Stein equations as they appear in discrete-time control problems, filtering, and image restoration on distributed-memory multicomputers.
Stabilization of large linear systems
We discuss numerical methods for the stabilization of large linear multi-input control systems of the form _ x = Ax + Bu via a feedback of the form u = F x. The method discussed in this paper is a
Specialized Parallel Algorithms for Solving Lyapunov and Stein Equations
TLDR
This work investigates iterative solvers based on the matrix sign function and the squared Smith iteration which are highly efficient on parallel distributed computers and shows that by coding using the Parallel Linear Algebra Package (PLAPACK) it is possible to exploit the structure in the matrices and reduce the cost of these solvers.
Singular Control Systems
  • L. Dai
  • Mathematics
    Lecture Notes in Control and Information Sciences
  • 1989
TLDR
This paper presents a meta-analyses of linear singular systems through system analysis via transfer matrix and feedback control of dynamic compensation for singular systems.
The Autonomous Linear Quadratic Control Problem: Theory and Numerical Solution
Notation and definitions.- Existence of solutions.- Eigenstructure of ?A - ?B, ?A? - ?B?.- Uniqueness and stability of feedback solutions.- Algebraic Riccati equations and deflating subspaces.-
Linear model reduction and solution of the algebraic Riccati equation by use of the sign function
The sign function of a square matrix can be defined in terms of a contour integral or as the result of an iterated map $. Application of this function enables a matrix to be decomposed into two
AN ANALYSIS OF THE POLE PLACEMENT PROBLEM. I. THE SINGLE-INPUT CASE
TLDR
The conditioning of the pole-placement problem is studied in terms of per- turbations in the data and how the conditioning depends on the condition number of the closed loop eigenvector matrix, which is a similar to a generalized Cauchy matrix.
...
...