Low-rank solution to an optimization problem constrained by the Navier-Stokes equations

Sergey Dolgov, Martin Stoll

Research output: Contribution to journalArticle

5 Citations (Scopus)
125 Downloads (Pure)

Abstract

The numerical solution of PDE-constrained optimization problems subject to the nonstationary Navier-Stokes equation is a challenging task. While space-time approaches often show favorable convergence properties, they often suffer from storage problems. Here we propose to approximate the solution to the optimization problem in a low-rank form, which is similar to the model order reduction (MOR) approach. However, in contrast to classical MOR schemes we do not compress the full solution at the end of the algorithm but start our algorithm with low-rank data and maintain this form throughout the iteration. Numerical experiments indicate that this approach reduces the computational costs by two orders of magnitude.

Original languageEnglish
Pages (from-to)A255-A280
JournalSIAM Journal on Scientific Computing
Volume39
Issue number1
Early online date8 Feb 2017
DOIs
Publication statusPublished - 2017

Keywords

  • Alternating solvers
  • Iterative solvers
  • Low-rank methods
  • Model reduction
  • PDE-constrained optimization
  • Preconditioning

Fingerprint Dive into the research topics of 'Low-rank solution to an optimization problem constrained by the Navier-Stokes equations'. Together they form a unique fingerprint.

  • Projects

    Cite this