skip to main content

DOE PAGESDOE PAGES

Title: Domain decomposition in time for PDE-constrained optimization

Here, PDE-constrained optimization problems have a wide range of applications, but they lead to very large and ill-conditioned linear systems, especially if the problems are time dependent. In this paper we outline an approach for dealing with such problems by decomposing them in time and applying an additive Schwarz preconditioner in time, so that we can take advantage of parallel computers to deal with the very large linear systems. We then illustrate the performance of our method on a variety of problems.
Authors:
 [1] ;  [2]
  1. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
  2. Max Planck Institute for Dynamics of Complex Technical Systems, Magdeburg (Germany)
Publication Date:
OSTI Identifier:
1249138
Report Number(s):
LLNL-JRNL--652253
Journal ID: ISSN 0010-4655
Grant/Contract Number:
AC52-07NA27344
Type:
Accepted Manuscript
Journal Name:
Computer Physics Communications
Additional Journal Information:
Journal Volume: 197; Journal Issue: C; Journal ID: ISSN 0010-4655
Publisher:
Elsevier
Research Org:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Org:
USDOE
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE PDE-constrained optimization; space–time methods; preconditioning; domain decomposition; parallel computing