| Abstract: | Solution algorithms for solving the Navier–Stokes equations without storing equation matrices are developed. The algorithms operate on a nodal basis, where the finite element information is stored as the co-ordinates of the nodes and the nodes in each element. Temporary storage is needed, such as the search vectors, correction vectors and right hand side vectors in the conjugate gradient algorithms which are limited to one-dimensional vectors. The nodal solution algorithms consist of splitting the Navier–Stokes equations into equation systems which are solved sequencially. In the pressure split algorithm, the velocities are found from the diffusion–convection equation and the pressure is computed from these velocities. The computed velocities are then corrected with the pressure gradient. In the velocity–pressure split algorithm, a velocity approximation is first found from the diffusion equation. This velocity is corrected by solving the convection equation. The pressure is then found from these velocities. Finally, the velocities are corrected by the pressure gradient. The nodal algorithms are compared by solving the original Navier–Stokes equations. The pressure split and velocity–pressure split equation systems are solved using ILU preconditioned conjugate gradient methods where the equation matrices are stored, and by using diagonal preconditioned conjugate gradient methods without storing the equation matrices. © 1998 John Wiley & Sons, Ltd. |
