1,649 research outputs found
Order reduction approaches for the algebraic Riccati equation and the LQR problem
We 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
Multiscale differential Riccati equations for linear quadratic regulator problems
We consider approximations to the solutions of differential Riccati equations
in the context of linear quadratic regulator problems, where the state equation
is governed by a multiscale operator. Similarly to elliptic and parabolic
problems, standard finite element discretizations perform poorly in this
setting unless the grid resolves the fine-scale features of the problem. This
results in unfeasible amounts of computation and high memory requirements. In
this paper, we demonstrate how the localized orthogonal decomposition method
may be used to acquire accurate results also for coarse discretizations, at the
low cost of solving a series of small, localized elliptic problems. We prove
second-order convergence (except for a logarithmic factor) in the
operator norm, and first-order convergence in the corresponding energy norm.
These results are both independent of the multiscale variations in the state
equation. In addition, we provide a detailed derivation of the fully discrete
matrix-valued equations, and show how they can be handled in a low-rank setting
for large-scale computations. In connection to this, we also show how to
efficiently compute the relevant operator-norm errors. Finally, our theoretical
results are validated by several numerical experiments.Comment: Accepted for publication in SIAM J. Sci. Comput. This version differs
from the previous one only by the addition of Remark 7.2 and minor changes in
formatting. 21 pages, 12 figure
Robust control of systems with real parameter uncertainty and unmodelled dynamics
Two significant contributions have been made during this research period in the research 'Robust Control of Systems with Real Parameter Uncertainty and Unmodelled Dynamics' under NASA Research Grant NAG-1-1102. They are: (1) a fast algorithm for computing the optimal H(sub infinity) norm for the four-block, the two block, or the one-block optimal H(sub infinity) optimization problem; and (2) a construction of an optimal H infinity controller without numerical difficulty. In using GD (Glover and Doyle) or DGKF (Doyle, Glover, Khargonekar, and Francis) approach to solve the standard H infinity norm which required bisection search. In this research period, we developed a very fast iterative algorithm for this computation. Our algorithm was developed based on hyperbolic interpolations which is much faster than any existing algorithm. The lower bound of the parameter, gamma, in the H infinity Riccati equation for solution existence is shown to be the square root of the supremum over all frequencies of the maximum eigenvalue of a given transfer matrix which can be computed easily. The lower band of gamma such that the H infinity Riccati equation has positive semidefinite solution can be also obtained by hyperbolic interpolation search. Another significant result in this research period is the elimination of the numerical difficulties arising in the construction of an optimal H infinity controller by directly applying the Glover and Doyle's state-space formulas. With the fast iterative algorithm for the computation of the optimal H infinity norm and the reliable construction of an optimal H infinity controller, we are ready to apply these tools in the design of robust controllers for the systems with unmodelled uncertainties. These tools will be also very useful when we consider systems with structured uncertainties
A theory of the infinite horizon LQ-problem for composite systems of PDEs with boundary control
We study the infinite horizon Linear-Quadratic problem and the associated
algebraic Riccati equations for systems with unbounded control actions. The
operator-theoretic context is motivated by composite systems of Partial
Differential Equations (PDE) with boundary or point control. Specific focus is
placed on systems of coupled hyperbolic/parabolic PDE with an overall
`predominant' hyperbolic character, such as, e.g., some models for
thermoelastic or fluid-structure interactions. While unbounded control actions
lead to Riccati equations with unbounded (operator) coefficients, unlike the
parabolic case solvability of these equations becomes a major issue, owing to
the lack of sufficient regularity of the solutions to the composite dynamics.
In the present case, even the more general theory appealing to estimates of the
singularity displayed by the kernel which occurs in the integral representation
of the solution to the control system fails. A novel framework which embodies
possible hyperbolic components of the dynamics has been introduced by the
authors in 2005, and a full theory of the LQ-problem on a finite time horizon
has been developed. The present paper provides the infinite time horizon
theory, culminating in well-posedness of the corresponding (algebraic) Riccati
equations. New technical challenges are encountered and new tools are needed,
especially in order to pinpoint the differentiability of the optimal solution.
The theory is illustrated by means of a boundary control problem arising in
thermoelasticity.Comment: 50 pages, submitte
New optimization methods in predictive control
This thesis is mainly concerned with the efficient solution of a linear discrete-time
finite horizon optimal control problem (FHOCP) with quadratic cost and linear constraints
on the states and inputs. In predictive control, such a FHOCP needs to be
solved online at each sampling instant. In order to solve such a FHOCP, it is necessary
to solve a quadratic programming (QP) problem. Interior point methods (IPMs) have
proven to be an efficient way of solving quadratic programming problems. A linear system
of equations needs to be solved in each iteration of an IPM. The ill-conditioning
of this linear system in the later iterations of the IPM prevents the use of an iterative
method in solving the linear system due to a very slow rate of convergence; in some cases
the solution never reaches the desired accuracy. A new well-conditioned IPM, which increases
the rate of convergence of the iterative method is proposed. The computational
advantage is obtained by the use of an inexact Newton method along with the use of
novel preconditioners.
A new warm-start strategy is also presented to solve a QP with an interior-point
method whose data is slightly perturbed from the previous QP. The effectiveness of
this warm-start strategy is demonstrated on a number of available online benchmark
problems. Numerical results indicate that the proposed technique depends upon the
size of perturbation and it leads to a reduction of 30-74% in floating point operations
compared to a cold-start interior point method.
Following the main theme of this thesis, which is to improve the computational efficiency
of an algorithm, an efficient algorithm for solving the coupled Sylvester equation
that arises in converting a system of linear differential-algebraic equations (DAEs) to
ordinary differential equations is also presented. A significant computational advantage
is obtained by exploiting the structure of the involved matrices. The proposed algorithm
removes the need to solve a standard Sylvester equation or to invert a matrix. The
improved performance of this new method over existing techniques is demonstrated by
comparing the number of floating-point operations and via numerical examples
- …