Math 2.0

Fluid mechanics Definition

Projection method

Builds on Navier–Stokes equationsHelmholtz decomposition of a velocity fieldPoisson's equationComputational fluid dynamicsIncompressible flow

Definition

Consider the incompressible Navier–Stokes equations on a bounded domain Ω⊂ℝd\Omega \subset \R^d with constant density ρ\rho, kinematic viscosity ν\nu and the no-slip boundary condition: ∂t𝐮+(𝐮⋅∇)𝐮=−1ρ∇p+νΔ𝐮,∇⋅𝐮=0.\partial_t \mathbf{u} + (\mathbf{u} \cdot \nabla) \mathbf{u} = -\frac{1}{\rho} \nabla p + \nu \Delta \mathbf{u}, \qquad \nabla \cdot \mathbf{u} = 0. Let Δt>0\Delta t > 0 be a time step and 𝐮n\mathbf{u}^n the approximation of 𝐮\mathbf{u} at time nΔtn \Delta t. The projection method computes 𝐮n+1\mathbf{u}^{n+1} and pn+1p^{n+1} from 𝐮n\mathbf{u}^n in three steps:

  1. compute an intermediate velocity 𝐮∗\mathbf{u}^*, equal to 00 on ∂Ω\partial\Omega, from the momentum equation without pressure, for example 𝐮∗−𝐮nΔt=−(𝐮n⋅∇)𝐮n+νΔ𝐮∗;\frac{\mathbf{u}^* - \mathbf{u}^n}{\Delta t} = -(\mathbf{u}^n \cdot \nabla) \mathbf{u}^n + \nu \Delta \mathbf{u}^*;
  2. solve the Poisson equation Δpn+1=ρΔt∇⋅𝐮∗\Delta p^{n+1} = \frac{\rho}{\Delta t} \nabla \cdot \mathbf{u}^* in Ω\Omega with ∂pn+1/∂𝐧=0\partial p^{n+1}/\partial \mathbf{n} = 0 on ∂Ω\partial \Omega;
  3. set 𝐮n+1=𝐮∗−Δtρ∇pn+1\mathbf{u}^{n+1} = \mathbf{u}^* - \frac{\Delta t}{\rho} \nabla p^{n+1}.

Remarks

Check: taking the divergence of step 3 and using step 2 gives ∇⋅𝐮n+1=∇⋅𝐮∗−ΔtρΔpn+1=0\nabla \cdot \mathbf{u}^{n+1} = \nabla \cdot \mathbf{u}^* - \frac{\Delta t}{\rho} \Delta p^{n+1} = 0, and the Neumann condition gives 𝐮n+1⋅𝐧=0\mathbf{u}^{n+1} \cdot \mathbf{n} = 0 on ∂Ω\partial\Omega. So 𝐮n+1\mathbf{u}^{n+1} is the L2L^2-orthogonal projection of 𝐮∗\mathbf{u}^* onto divergence-free fields tangent to the boundary, the Leray projection given by the Helmholtz decomposition. Non-example: the step 𝐮n+1=𝐮∗\mathbf{u}^{n+1} = \mathbf{u}^* alone, without steps 2 and 3, does not keep the velocity divergence-free, so it is not a projection method. The tangential part of 𝐮n+1\mathbf{u}^{n+1} does not vanish exactly on ∂Ω\partial \Omega, which creates a numerical boundary layer. The basic scheme is first-order in time, and incremental variants that reuse pnp^n in step 1 reach second order.

Reading path

To understand this page from the ground up, read these 30 pages in order. The foundations come first.

Show the path as a graph
Computational fluid dynamics, concept, no evidence levelComputational fluid d…conceptDifferential form, concept, no evidence levelDifferential formconceptEuclidean space, object, no evidence levelEuclidean spaceobjectFunction, concept, no evidence levelFunctionconceptHodge star operator, concept, no evidence levelHodge star operatorconceptIncompressible flow, concept, no evidence levelIncompressible flowconceptNavier–Stokes equations, concept, no evidence levelNavier–Stokes equatio…conceptOrientation of a manifold, concept, no evidence levelOrientation of a mani…conceptPoisson's equation, concept, no evidence levelPoisson's equationconceptRiemannian manifold, concept, no evidence levelRiemannian manifoldconceptSheaf cohomology, concept, no evidence levelSheaf cohomologyconceptSingular cohomology, concept, no evidence levelSingular cohomologyconceptSmooth function, concept, no evidence levelSmooth functionconceptde Rham cohomology, concept, no evidence levelde Rham cohomologyconceptExterior derivative, concept, no evidence levelExterior derivativeconceptTotal derivative, concept, no evidence levelTotal derivativeconceptFunction of several variables, concept, no evidence levelFunction of several v…conceptVector-valued function, concept, no evidence levelVector-valued functionconceptDifferentiable function of several variables, concept, no evidence levelDifferentiable functi…conceptPartial derivative, concept, no evidence levelPartial derivativeconceptVector field, concept, no evidence levelVector fieldconceptHodge theorem, statement, no evidence levelHodge theoremstatementGradient, concept, no evidence levelGradientconceptCurl, concept, no evidence levelCurlconceptDivergence, concept, no evidence levelDivergenceconceptHodge decomposition, statement, no evidence levelHodge decompositionstatementLaplacian, concept, no evidence levelLaplacianconceptHarmonic function, concept, no evidence levelHarmonic functionconceptHelmholtz decomposition of a velocity field, statement, no evidence levelHelmholtz decompositi…statementProjection method, definition, no evidence levelProjection methoddefinition
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Computational fluid dynamics concept
  2. Differential form concept
  3. Euclidean space object
  4. Function concept
  5. Hodge star operator concept
  6. Incompressible flow concept
  7. Navier–Stokes equations concept
  8. Orientation of a manifold concept
  9. Poisson's equation concept
  10. Riemannian manifold concept
  11. Sheaf cohomology concept
  12. Singular cohomology concept
  13. Smooth function concept
  14. de Rham cohomology concept
  15. Exterior derivative concept
  16. Total derivative concept
  17. Function of several variables concept
  18. Vector-valued function concept
  19. Differentiable function of several variables concept
  20. Partial derivative concept
  21. Vector field concept
  22. Hodge theorem statement
  23. Gradient concept
  24. Curl concept
  25. Divergence concept
  26. Hodge decomposition statement
  27. Laplacian concept
  28. Harmonic function concept
  29. Helmholtz decomposition of a velocity field statement
  30. Projection method definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Projection_method_(fluid_dynamics)
About this page
TagY2MYV7ZDM7
URIm2://Y2MYV7ZDM7
Kinddefinition
WritingW0 stub
MSC76M20, 76D05, 65M06
DefinesProjection method
UsesNavier–Stokes equations, Helmholtz decomposition of a velocity field, Poisson's equation, Computational fluid dynamics, Incompressible flow
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.