Computational efficiency of the hybrid penalty-pseudocompressibility method for incompressible flow (Q1327277): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:35, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational efficiency of the hybrid penalty-pseudocompressibility method for incompressible flow |
scientific article |
Statements
Computational efficiency of the hybrid penalty-pseudocompressibility method for incompressible flow (English)
0 references
5 April 1995
0 references
We implement the title method to within a specified error, and also a method of subcycling the rapidly-varying terms. This makes the hybrid method directly comparable to standard implicit methods of solving the incompressible flow equations. We find that the hybrid method is still inferior with regard to computational work to methods based on conjugate gradients, and this conclusion appears to hold independently of mesh resolution.
0 references
specified error
0 references
method of subcycling the rapidly-varying terms
0 references
standard implicit methods
0 references
conjugate gradients
0 references
