2006
DOI: 10.1016/j.aml.2005.10.021
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the iterative penalty method for the Stokes equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
5
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 8 publications
1
5
0
Order By: Relevance
“…In general we have found the iterative regularization constant to lie in the range of 0.01-0.05. This is also in conformity with recommendations for this constant found in literature (Dai and Cheng, 2008;Lin et al, 2004;Xiao-liang and Shaikh, 2006).…”
Section: Skewed Cavitysupporting
confidence: 93%
See 2 more Smart Citations
“…In general we have found the iterative regularization constant to lie in the range of 0.01-0.05. This is also in conformity with recommendations for this constant found in literature (Dai and Cheng, 2008;Lin et al, 2004;Xiao-liang and Shaikh, 2006).…”
Section: Skewed Cavitysupporting
confidence: 93%
“…Iterative penalty thus introduces a regularization step to enforce the incompressibility constraint. We employ the formulation of this method as outlined in (Dai and Cheng, 2008;Lin et al, 2004;Xiao-liang and Shaikh, 2006). The governing equations take the form…”
Section: Incompressible Flow Equations and Penalty Techniquesmentioning
confidence: 99%
See 1 more Smart Citation
“…Iterated penalty methods for solving Stokes and NSE problem have been used successfully for many years, see e.g. [29][30][31], and analysis of iterated penalty methods is generally done by transforming to a coupled system with artificial incompressibility/pressure regularization. Next, we analyze the methods directly, taking advantage of the divergence-free subspace V h and that the norm of its orthogonal complement in X h is the divergence norm.…”
Section: Connection To the Classical Iterated Penalty Methodsmentioning
confidence: 99%
“…Consider now the classical iterated penalty algorithm, based on a formulation from [29] and in the same spirit as in [33,31,30], but here we use exact integration in the penalty term. Step 0:…”
Section: Algorithm 41 (Pointwise Divergence Free Solution For Couplementioning
confidence: 99%