Premium
A posteriori finite element bounds to linear functional outputs of the three‐dimensional Navier–Stokes equations
Author(s) -
Cheng Zhong,
Paraschivoiu Marius
Publication year - 2004
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1132
Subject(s) - finite element method , mathematics , upper and lower bounds , a priori and a posteriori , reynolds number , navier–stokes equations , linearization , pressure correction method , mathematical analysis , compressibility , incompressible flow , flow (mathematics) , nonlinear system , geometry , physics , mechanics , philosophy , epistemology , quantum mechanics , turbulence , thermodynamics
An implicit a posteriori finite element error estimation method is presented to inexpensively calculate lower and upper bounds for a linear functional output of the numerical solutions to the three‐dimensional Navier–Stokes (N–S) equations. The novelty of this research is to utilize an augmented Lagrangian based on a coarse mesh linearization of the N–S equations and the finite element tearing and interconnecting (FETI) procedure. The latter approach extends the a posteriori bound method to the three‐dimensional Crouzeix–Raviart space for N–S problems. The computational advantage of the bound procedure is that a single coupled non‐symmetric large problem can be decomposed into several uncoupled symmetric small problems. A simple model problem, which is selected here to illustrate the procedure, is to find the lower and upper bounds of the average velocity of a pressure driven, incompressible, steady Newtonian fluid flow moving at low Reynolds numbers through an endless square channel which has an array of rectangular obstacles. Numerical results show that the bounds for this output are rigorous, i.e. always in the asymptotic certainty regime, that they are sharp and that the required computational resources decrease significantly. Parallel implementation on a Beowulf cluster is also reported. Copyright © 2004 John Wiley & Sons, Ltd.