8,563 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
Pipeline Implementations of Neumann-Neumann and Dirichlet-Neumann Waveform Relaxation Methods
This paper is concerned with the reformulation of Neumann-Neumann Waveform
Relaxation (NNWR) methods and Dirichlet-Neumann Waveform Relaxation (DNWR)
methods, a family of parallel space-time approaches to solving time-dependent
PDEs. By changing the order of the operations, pipeline-parallel computation of
the waveform iterates are possible without changing the final solution. The
parallel efficiency and the increased communication cost of the pipeline
implementation is presented, along with weak scaling studies to show the
effectiveness of the pipeline NNWR and DNWR algorithms.Comment: 20 pages, 8 figure
Solving optimal control problems governed by random Navier-Stokes equations using low-rank methods
Many problems in computational science and engineering are simultaneously
characterized by the following challenging issues: uncertainty, nonlinearity,
nonstationarity and high dimensionality. Existing numerical techniques for such
models would typically require considerable computational and storage
resources. This is the case, for instance, for an optimization problem governed
by time-dependent Navier-Stokes equations with uncertain inputs. In particular,
the stochastic Galerkin finite element method often leads to a prohibitively
high dimensional saddle-point system with tensor product structure. In this
paper, we approximate the solution by the low-rank Tensor Train decomposition,
and present a numerically efficient algorithm to solve the optimality equations
directly in the low-rank representation. We show that the solution of the
vorticity minimization problem with a distributed control admits a
representation with ranks that depend modestly on model and discretization
parameters even for high Reynolds numbers. For lower Reynolds numbers this is
also the case for a boundary control. This opens the way for a reduced-order
modeling of the stochastic optimal flow control with a moderate cost at all
stages.Comment: 29 page
Regularization-robust preconditioners for time-dependent PDE constrained optimization problems
In this article, we motivate, derive and test �effective preconditioners to be used with the Minres algorithm for solving a number of saddle point systems, which arise in PDE constrained optimization problems. We consider the distributed control problem involving the heat equation with two diff�erent functionals, and the Neumann boundary control problem involving Poisson's equation and the heat equation. Crucial to the eff�ectiveness of our preconditioners in each case is an eff�ective approximation of the Schur complement of the matrix system. In each case, we state the problem being solved, propose the preconditioning approach, prove relevant eigenvalue bounds, and provide numerical results which demonstrate that our solvers are eff�ective for a wide range of regularization parameter values, as well as mesh sizes and time-steps
All-at-Once Solution if Time-Dependent PDE-Constrained Optimisation Problems
Time-dependent partial differential equations (PDEs) play an important role in applied mathematics and many other areas of science. One-shot methods try to compute the solution to these problems in a single iteration that solves for all time-steps at the same time. In this paper, we look at one-shot approaches for the optimal control of time-dependent PDEs and focus on the fast solution of these problems. The use of Krylov subspace solvers together with an efficient preconditioner allows for minimal storage requirements. We solve only approximate time-evolutions for both forward and adjoint problem and compute accurate solutions of a given control problem only at convergence of the overall Krylov subspace iteration. We show that our approach can give competitive results for a variety of problem formulations
A linear domain decomposition method for partially saturated flow in porous media
The Richards equation is a nonlinear parabolic equation that is commonly used
for modelling saturated/unsaturated flow in porous media. We assume that the
medium occupies a bounded Lipschitz domain partitioned into two disjoint
subdomains separated by a fixed interface . This leads to two problems
defined on the subdomains which are coupled through conditions expressing flux
and pressure continuity at . After an Euler implicit discretisation of
the resulting nonlinear subproblems a linear iterative (-type) domain
decomposition scheme is proposed. The convergence of the scheme is proved
rigorously. In the last part we present numerical results that are in line with
the theoretical finding, in particular the unconditional convergence of the
scheme. We further compare the scheme to other approaches not making use of a
domain decomposition. Namely, we compare to a Newton and a Picard scheme. We
show that the proposed scheme is more stable than the Newton scheme while
remaining comparable in computational time, even if no parallelisation is being
adopted. Finally we present a parametric study that can be used to optimize the
proposed scheme.Comment: 34 pages, 13 figures, 7 table
- …