2017
DOI: 10.1016/j.cma.2016.10.014
|View full text |Cite
|
Sign up to set email alerts
|

A scalable block-preconditioning strategy for divergence-conforming B-spline discretizations of the Stokes problem

Abstract: This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. AbstractThe recently introduced divergence-confo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 40 publications
(73 reference statements)
0
12
0
Order By: Relevance
“…The question we try to answer in this paper is whether they are applicable to the IgA discretizations of high degree and high order of continuity with the same success. A similar study was done for IgA discretizations of the Stokes equations by Côrtes et al, 16 where the authors combine a block triangular strategy with several “black‐box” solvers to get a scalable preconditioner. We consider the steady and unsteady Navier–Stokes equations linearized by Picard method and present a comparison of ideal versions of several block preconditioners.…”
Section: Introductionmentioning
confidence: 94%
“…The question we try to answer in this paper is whether they are applicable to the IgA discretizations of high degree and high order of continuity with the same success. A similar study was done for IgA discretizations of the Stokes equations by Côrtes et al, 16 where the authors combine a block triangular strategy with several “black‐box” solvers to get a scalable preconditioner. We consider the steady and unsteady Navier–Stokes equations linearized by Picard method and present a comparison of ideal versions of several block preconditioners.…”
Section: Introductionmentioning
confidence: 94%
“…Our parallel implementation is built on top of PetIGA [71] and PetIGA-MF [72,73,74], which gives us access to the preconditioners of the scientific library PETSc [75] and the ones in other libraries as the BoomerAMG package of hypre [76] and the ML library [77]. To linearize the residual R K , we use a Newton-Raphson method.…”
Section: Use the Intermediate Time Levels To Assemble The Residual Vementioning
confidence: 99%
“…As linear solver for the kinematic equation, we use the GMRES method [79] with an incomplete LU preconditioner. As linear solver for the momemtum and mass conservation equations, we use the scalable block-preconditioning strategy defined in [73] for divergence-conforming B-splines.…”
Section: Use the Intermediate Time Levels To Assemble The Residual Vementioning
confidence: 99%
See 1 more Smart Citation
“…In fact, only the performance of Krylov subspace methods in conjunction with block preconditioners has been investigated in prior work. 15,16 The objective of the current work is to introduce an optimally efficient linear solution procedure for isogeometric compatible discretizations of the generalized Stokes and Oseen problems. It should be noted that there are many different candidates in this regard.…”
Section: Introductionmentioning
confidence: 99%