Preconditioning Navier–Stokes control using multilevel sequentially semiseparable matrix computations

Yue Qiu, Martin B. van Gijzen, Jan Willem van Wingerden, Michel Verhaegen, Cornelis Vuik*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)
103 Downloads (Pure)

Abstract

In this article, we study preconditioning techniques for the control of the Navier–Stokes equation, where the control only acts on a few parts of the domain. Optimization, discretization, and linearization of the control problem results in a generalized linear saddle-point system. The Schur complement for the generalized saddle-point system is very difficult or even impossible to approximate, which prohibits satisfactory performance of the standard block preconditioners. We apply the multilevel sequentially semiseparable (MSSS) preconditioner to the underlying system. Compared with standard block preconditioning techniques, the MSSS preconditioner computes an approximate factorization of the global generalized saddle-point matrix up to a prescribed accuracy in linear computational complexity. This in turn gives parameter independent convergence for MSSS preconditioned Krylov solvers. We use a simplified wind farm control example to illustrate the performance of the MSSS preconditioner. We also compare the performance of the MSSS preconditioner with the performance of the state-of-the-art preconditioning techniques. Our results show the superiority of the MSSS preconditioning techniques to standard block preconditioning techniques for the control of the Navier–Stokes equation.

Original languageEnglish
Article numbere2349
Number of pages21
JournalNumerical Linear Algebra with Applications
Volume28
Issue number2
DOIs
Publication statusPublished - 2021

Keywords

  • generalized saddle-point systems
  • MSSS preconditioners
  • Navier–Stokes control

Fingerprint

Dive into the research topics of 'Preconditioning Navier–Stokes control using multilevel sequentially semiseparable matrix computations'. Together they form a unique fingerprint.

Cite this