𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Domain decomposition methods for advection dominated linear-quadratic elliptic optimal control problems

✍ Scribed by Roscoe A. Bartlett; Matthias Heinkenschloss; Denis Ridzal; Bart G. van Bloemen Waanders


Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
298 KB
Volume
195
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

✦ Synopsis


We present an optimization-level domain decomposition (DD) preconditioner for the solution of advection dominated elliptic linearquadratic optimal control problems, which arise in many science and engineering applications. The DD preconditioner is based on a decomposition of the optimality conditions for the elliptic linear-quadratic optimal control problem into smaller subdomain optimality conditions with Dirichlet boundary conditions for the states and the adjoints on the subdomain interfaces. These subdomain optimality conditions are coupled through Robin transmission conditions for the states and the adjoints. The parameters in the Robin transmission condition depend on the advection. This decomposition leads to a Schur complement system in which the unknowns are the state and adjoint variables on the subdomain interfaces. The Schur complement operator is the sum of subdomain Schur complement operators, the application of which is shown to correspond to the solution of subdomain optimal control problems, which are essentially smaller copies of the original optimal control problem. We show that, under suitable conditions, the application of the inverse of the subdomain Schur complement operators requires the solution of a subdomain elliptic linear-quadratic optimal control problem with Robin boundary conditions for the state.

Numerical tests for problems with distributed and with boundary control show that the dependence of the preconditioners on mesh size and subdomain size is comparable to its counterpart applied to a single advection dominated equation. These tests also show that the preconditioners are insensitive to the size of the control regularization parameter.


πŸ“œ SIMILAR VOLUMES


Short communication: A collocation-type
✍ GAMAL N. ELNAGAR; MOHSEN RAZZAGHI πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 299 KB πŸ‘ 1 views

This communication presents a spectral method for solving time-varying linear quadratic optimal control problems. Legendre-Gauss-Lobatto nodes are used to construct the mth-degree polynomial approximation of the state and control variables. The derivative x (t) of the state vector x(t) is approximae

A Domain Decomposition Method for the He
✍ Jean-David Benamou; Bruno DesprΓ¨s πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 504 KB

We present an iterative domain decomposition method to solve the Helmholtz equation and related optimal control problems. The tionally expresses that the control is optimal. This method proof of convergence of this method relies on energy techniques. actually solves at the same time the equations an

A Schwarz domain decomposition method wi
✍ Huibin Chang; Danping Yang πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 604 KB

Geometric convergence rate a b s t r a c t A domain decomposition method (DDM) is presented to solve the distributed optimal control problem. The optimal control problem essentially couples an elliptic partial differential equation with respect to the state variable and a variational inequality with

A direct approach using the finite eleme
✍ J. Nakamichi; K. Washizu πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 559 KB

## The present paper proposes a numerical approach to a linear optimal control problem with a quadratic performance index. In this technique, the time interval is divided into a number of time segments and all of the unknown functions which appear in the performance index are either interpolated lin