A MEMORY-EFFICIENT UNSTRUCTURED GRID REFINEMENT ALGORITHM FOR COMPUTATION OF 3D STEADY VISCOUS FLOWS
From MaRDI portal
Publication:4339934
DOI10.1002/(SICI)1099-0887(199704)13:4%3C219::AID-CNM41%3E3.0.CO;2-9zbMATH Open0878.76061OpenAlexW2031745038MaRDI QIDQ4339934FDOQ4339934
Publication date: 12 January 1998
Full work available at URL: https://doi.org/10.1002/(sici)1099-0887(199704)13:4%3C219::aid-cnm41%3E3.0.co;2-9
Recommendations
- Parallel adaptive refinement for unsteady flow calculations on 3D unstructured grids
- A 3-D refinement algorithm suitable for adaptive and multi-grid techniques
- A new procedure for dynamic adaption of three-dimensional unstructured grids
- An efficient method for generation of three-dimensional unstructured grids
Cites Work
- Adaptive remeshing for compressible flow computations
- Algorithms for refining triangular grids suitable for adaptive and multigrid techniques
- Adaptative remeshing for viscous incompressible flows
- Error estimation and adaptivity in Navier-Stokes incompressible flows
- Local Bisection Refinement for N-Simplicial Grids Generated by Reflection
- Adaptive remeshing for transient problems
- Finite Difference Schemes on Triangular Cell-Centered Grids with Local Refinement
- Adaptive h‐refinement on 3D unstructured grids for transient problems
- Adaptive finite element methods for the analysis of inviscid compressible flow: I: Fast refinement/unrefinement and moving mesh methods for unstructured meshes
- p‐version least squares finite element formulation for two‐dimensional, incompressible fluid flow
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: A MEMORY-EFFICIENT UNSTRUCTURED GRID REFINEMENT ALGORITHM FOR COMPUTATION OF 3D STEADY VISCOUS FLOWS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339934)
