TY - JOUR

T1 - DGIRM

T2 - Discontinuous Galerkin based isogeometric residual minimization for the Stokes problem

AU - Łoś, Marcin

AU - Rojas, Sergio

AU - Paszyński, Maciej

AU - Muga, Ignacio

AU - Calo, Victor M.

N1 - Publisher Copyright:
© 2021
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2021/3

Y1 - 2021/3

N2 - In this paper, we introduce a stable isogeometric analysis discretization of the Stokes system of equations. We use this standard constrained problem to demonstrate the flexibility and robustness of the residual minimization method on dual stable norms [16], which unlocks the extraordinary approximation power of isogeometric analysis [44]. That is, we introduce an isogeometric residual minimization method (IRM) for the Stokes equations, which minimizes the residual in a dual discontinuous Galerkin norm; thus we use the acronym DGiRM. Following Calo et al. [16], we start from an inf-sup stable discontinuous Galerkin (DG) formulation to approximate in a highly continuous trial space that minimizes the dual norm of the residual in a discontinuous test space. We demonstrate the performance and robustness of the methodology considering a manufactured solution and the well-known lid-driven cavity flow problem. First, we use a multi-frontal direct solver, and, using the Pareto front, compare the resulting numerical accuracy and the computational cost expressed by the number of floating-point operations performed by the direct solver algorithm. Second, we use an iterative solver. We measure the number of iterations required when increasing the mesh size and how the configuration of spaces affect the resulting accuracy. This paper is an extension of the paper A Stable Discontinuous Galerkin Based Isogeometric Residual Minimization for the Stokes Problem by M. Łoś, et al. (2020) published in Lecture Notes in Computer Science. In this extended version, we deepen in the mathematical aspects of the DGiRM, include the iterative solver algorithm and implementation, and discuss the influence of different discretization spaces on the iterative solver's convergence.

AB - In this paper, we introduce a stable isogeometric analysis discretization of the Stokes system of equations. We use this standard constrained problem to demonstrate the flexibility and robustness of the residual minimization method on dual stable norms [16], which unlocks the extraordinary approximation power of isogeometric analysis [44]. That is, we introduce an isogeometric residual minimization method (IRM) for the Stokes equations, which minimizes the residual in a dual discontinuous Galerkin norm; thus we use the acronym DGiRM. Following Calo et al. [16], we start from an inf-sup stable discontinuous Galerkin (DG) formulation to approximate in a highly continuous trial space that minimizes the dual norm of the residual in a discontinuous test space. We demonstrate the performance and robustness of the methodology considering a manufactured solution and the well-known lid-driven cavity flow problem. First, we use a multi-frontal direct solver, and, using the Pareto front, compare the resulting numerical accuracy and the computational cost expressed by the number of floating-point operations performed by the direct solver algorithm. Second, we use an iterative solver. We measure the number of iterations required when increasing the mesh size and how the configuration of spaces affect the resulting accuracy. This paper is an extension of the paper A Stable Discontinuous Galerkin Based Isogeometric Residual Minimization for the Stokes Problem by M. Łoś, et al. (2020) published in Lecture Notes in Computer Science. In this extended version, we deepen in the mathematical aspects of the DGiRM, include the iterative solver algorithm and implementation, and discuss the influence of different discretization spaces on the iterative solver's convergence.

KW - Computational cost

KW - Direct solvers

KW - Discontinuous Galerkin

KW - Isogeometric analysis

KW - Iterative solvers

KW - Residual minimization

KW - Stokes problem

UR - http://www.scopus.com/inward/record.url?scp=85099786985&partnerID=8YFLogxK

U2 - 10.1016/j.jocs.2021.101306

DO - 10.1016/j.jocs.2021.101306

M3 - Article

AN - SCOPUS:85099786985

SN - 1877-7503

VL - 50

JO - Journal of Computational Science

JF - Journal of Computational Science

M1 - 101306

ER -