A perturbation method for optimizing matrix stability
A perturbation method is proposed for optimizing the stability of a matrix by minimizing its spectral abscissa. This approach is based on the perturbation theory for a matrix with simple eigenvalues. The active eigenvalue (i.e. the eigenvalue with the greatest positive real part) is shifted to the left (in the complex plane) by a small amount. The proposed procedure is repeated until the minimum of the spectral abscissa is reached. The affine matrix problem is considered: given \(m+1\) real \(n\times n\) matrices \(A_0,A_1,\dots,A_m\), find a real vector \({\mathbf t}=(t_1,t_2,\dots,t_m)\) such that the affine matrix family \(A({\mathbf t})=A_0+\sum_{i=1}^mt_iA_i\) is stabilized with a minimum spectral abscissa. A perturbation algorithm is provided for this problem, which uses the solution of a linear programming problem. A similar algorithm is derived for the output feedback control problem. This algorithm is applied to a model of a Boeing 747 aircraft jet at a flutter condition and to a nuclear powered turbo-generator. A necessary optimality condition is given for matrices with a unique active eigenvalue, as well as a sufficient condition for the case of several active eigenvalues. These conditions are used in the proposed algorithms.
- A cone complementarity linearization algorithm for static output-feedback and related problems
- A matrix inverse eigenvalue problem and its application
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3239038 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Inertia characteristics of self-adjoint matrix polynomials
- Low-order control design for LMI problems using alternating projection methods
- NP-Hardness of Some Linear Control Design Problems
- On condition numbers of a nondefective multiple eigenvalue
- Optimal stability and eigenvalue multiplicity
- Partially Augmented Lagrangian Method for Matrix Inequality Constraints
- Robust Control via Sequential Semidefinite Programming
- Two numerical methods for optimizing matrix stability
- Two numerical methods for optimizing matrix stability
- A formula for computation of the real stability radius
- Efficient vectors for simple perturbed consistent matrices
- Optimizing matrix stability
- Search method for the matrix multiplier time constant and the weighting matrix of the multivariable Popov stability criterion
- The smoothed spectral abscissa for robust stability optimization
- Stabilization of a matrix via a low-rank-adaptive ODE
This page was built for publication: A perturbation method for optimizing matrix stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616397)