1,284 research outputs found
Efficient Solution of Large-Scale Algebraic Riccati Equations Associated with Index-2 DAEs via the Inexact Low-Rank Newton-ADI Method
This paper extends the algorithm of Benner, Heinkenschloss, Saak, and
Weichelt: An inexact low-rank Newton-ADI method for large-scale algebraic
Riccati equations, Applied Numerical Mathematics Vol.~108 (2016), pp.~125--142,
doi:10.1016/j.apnum.2016.05.006 to Riccati equations associated with Hessenberg
index-2 Differential Algebratic Equation (DAE) systems. Such DAE systems arise,
e.g., from semi-discretized, linearized (around steady state) Navier-Stokes
equations. The solution of the associated Riccati equation is important, e.g.,
to compute feedback laws that stabilize the Navier-Stokes equations. Challenges
in the numerical solution of the Riccati equation arise from the large-scale of
the underlying systems and the algebraic constraint in the DAE system. These
challenges are met by a careful extension of the inexact low-rank Newton-ADI
method to the case of DAE systems. A main ingredient in the extension to the
DAE case is the projection onto the manifold described by the algebraic
constraints. In the algorithm, the equations are never explicitly projected,
but the projection is only applied as needed. Numerical experience indicates
that the algorithmic choices for the control of inexactness and line-search can
help avoid subproblems with matrices that are only marginally stable. The
performance of the algorithm is illustrated on a large-scale Riccati equation
associated with the stabilization of Navier-Stokes flow around a cylinder.Comment: 21 pages, 2 figures, 4 table
A numerical comparison of solvers for large-scale, continuous-time algebraic Riccati equations and LQR problems
In this paper, we discuss numerical methods for solving large-scale
continuous-time algebraic Riccati equations. These methods have been the focus
of intensive research in recent years, and significant progress has been made
in both the theoretical understanding and efficient implementation of various
competing algorithms. There are several goals of this manuscript: first, to
gather in one place an overview of different approaches for solving large-scale
Riccati equations, and to point to the recent advances in each of them. Second,
to analyze and compare the main computational ingredients of these algorithms,
to detect their strong points and their potential bottlenecks. And finally, to
compare the effective implementations of all methods on a set of relevant
benchmark examples, giving an indication of their relative performance
Linear theory for filtering nonlinear multiscale systems with model error
We study filtering of multiscale dynamical systems with model error arising
from unresolved smaller scale processes. The analysis assumes continuous-time
noisy observations of all components of the slow variables alone. For a linear
model with Gaussian noise, we prove existence of a unique choice of parameters
in a linear reduced model for the slow variables. The linear theory extends to
to a non-Gaussian, nonlinear test problem, where we assume we know the optimal
stochastic parameterization and the correct observation model. We show that
when the parameterization is inappropriate, parameters chosen for good filter
performance may give poor equilibrium statistical estimates and vice versa.
Given the correct parameterization, it is imperative to estimate the parameters
simultaneously and to account for the nonlinear feedback of the stochastic
parameters into the reduced filter estimates. In numerical experiments on the
two-layer Lorenz-96 model, we find that parameters estimated online, as part of
a filtering procedure, produce accurate filtering and equilibrium statistical
prediction. In contrast, a linear regression based offline method, which fits
the parameters to a given training data set independently from the filter,
yields filter estimates which are worse than the observations or even divergent
when the slow variables are not fully observed
Peer Methods for the Solution of Large-Scale Differential Matrix Equations
We consider the application of implicit and linearly implicit
(Rosenbrock-type) peer methods to matrix-valued ordinary differential
equations. In particular the differential Riccati equation (DRE) is
investigated. For the Rosenbrock-type schemes, a reformulation capable of
avoiding a number of Jacobian applications is developed that, in the autonomous
case, reduces the computational complexity of the algorithms. Dealing with
large-scale problems, an efficient implementation based on low-rank symmetric
indefinite factorizations is presented. The performance of both peer approaches
up to order 4 is compared to existing implicit time integration schemes for
matrix-valued differential equations.Comment: 29 pages, 2 figures (including 6 subfigures each), 3 tables,
Corrected typo
Model order reduction approaches for infinite horizon optimal control problems via the HJB equation
We investigate feedback control for infinite horizon optimal control problems
for partial differential equations. The method is based on the coupling between
Hamilton-Jacobi-Bellman (HJB) equations and model reduction techniques. It is
well-known that HJB equations suffer the so called curse of dimensionality and,
therefore, a reduction of the dimension of the system is mandatory. In this
report we focus on the infinite horizon optimal control problem with quadratic
cost functionals. We compare several model reduction methods such as Proper
Orthogonal Decomposition, Balanced Truncation and a new algebraic Riccati
equation based approach. Finally, we present numerical examples and discuss
several features of the different methods analyzing advantages and
disadvantages of the reduction methods
- …