arrow
返回

OPTIMAL SOLVERS FOR PDE-CONSTRAINED OPTIMIZATION

delete2010-01-01
delete185
delete
OA
AI
T
Tyrone Rees *
H
H. Sue Dollar
A
Andrew J. Wathen
DOI:10.1137/080727154delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Optimization problems with constraints which require the solution of a partial differential equation arise widely in many areas of the sciences and engineering, particularly in problems of design. The solution of such PDE-constrained optimization problems is usually a major computational task. Here we consider simple problems of this type: distributed control problems in which the 2- and 3-dimensional Poisson problem is the PDE. The large-dimensional linear systems which result from discretization and which need to be solved are of saddle-point type. We introduce two optimal preconditioners for these systems, which lead to convergence of symmetric Krylov subspace iterative methods in a number of iterations which does not increase with the dimension of the discrete problem. These preconditioners are block structured and involve standard multigrid cycles. The optimality of the preconditioned iterative solver is proved theoretically and verified computationally in several test cases. The theoretical proof indicates that these approaches may have much broader applicability for other PDEs.
Keyword:
saddle-point problems
PDE-constrained optimization
preconditioning
optimal control
linear systems
all-at-once methods

期刊

SIAM Journal on Scientific Computing 封面图
SIAM Journal on Scientific Computing
IF:
2.6
论文数:
5.1K
被引数:
1.8W

机构

U
uk research & innovation (ukri)
学者数:
2.7W
论文数: 2.3W
被引数: 32
U
university of oxford
学者数:
9.8W
论文数: 8.6W
被引数: 137
引用论文

引用论文

err2003-01-01
err0
PREAI
errY. Radzyner
err分享
err收藏
err分享
err收藏
学者 查看更多内容