31 research outputs found
General minimal residual Krylov subspace method for large-scale model reduction
No full textPublished versio
Fault-tolerant observer design with a tolerance measure for systems with sensor failure
Get PDFA fault-tolerant switching observer design methodology is proposed. The aim is to maintain a desired level of closed-loop performance under a range of sensor fault scenarios while the fault-free nominal performance is optimized. The range of considered fault scenarios is determined by a minimum number p of assumed working sensors. Thus the smaller p is, the more fault tolerant is the observer. This is then used to define a fault tolerance measure for observer design. Due to the combinatorial nature of the problem, a semidefinite relaxation procedure is proposed to deal with the large number of fault scenarios for systems that have many vulnerable sensors. The procedure results in a significant reduction in the number of constraints needed to solve the problem. Two numerical examples are presented to illustrate the effectiveness of the fault-tolerant observer design
A study on LQG/LTR control for damping inter-area oscillations in power systems
Get PDFPublished versio
Implicitly restarted Krylov subspace methods for stable partial realizations
No full textPublished versio
A linear matrix inequality approach to robust damping control design in power systems with superconducting magnetic energy storage device
No full textPublished versio
Order reduction approaches for the algebraic Riccati equation and the LQR problem
Full text linkWe explore order reduction techniques for solving the algebraic Riccati
equation (ARE), and investigating the numerical solution of the
linear-quadratic regulator problem (LQR). A classical approach is to build a
surrogate low dimensional model of the dynamical system, for instance by means
of balanced truncation, and then solve the corresponding ARE. Alternatively,
iterative methods can be used to directly solve the ARE and use its approximate
solution to estimate quantities associated with the LQR. We propose a class of
Petrov-Galerkin strategies that simultaneously reduce the dynamical system
while approximately solving the ARE by projection. This methodology
significantly generalizes a recently developed Galerkin method by using a pair
of projection spaces, as it is often done in model order reduction of dynamical
systems. Numerical experiments illustrate the advantages of the new class of
methods over classical approaches when dealing with large matrices
