An adaptive grid polygonal finite volume method for the compressibleflow equations

Struijs, R.; Vankeirsbilck, Patrick; Deconinck, H.

doi:10.2514/6.1989-1959

Cited by 10 publications

(5 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…2-4. Comparing with the mesh (Struijs et al, 1989) which was obtained by the grid enrichment technique based on the pressure or strea.mwise entropy gradients, the similar grid pattern (Fig. 2) is generated.…”

Section: Code Validationmentioning

confidence: 76%

Inviscid and Viscous Solutions for Airfoil/Cascade Flows Using a Locally Implicit Algorithm on Adaptive Meshes

Hwang

Liu

1990

Volume 1: Turbomachinery

View full text Add to dashboard Cite

A numerical solution procedure, which includes a locally implicit finite volume scheme and an adaptive mesh generation technique, has been developed to study airfoil and cascade flows. The Euler/Navier-Stokes, continuity and energy equations, in conjunction with Baldwin-Lomax model for turbulent flow, are solved in cartesian coordinate system. To simulate physical phenomena efficiently and correctly, a mixed type of mesh, the unstructured triangular cell for the inviscid region and structured quadrilateral cell for the viscous, boundary layer and wake regions, is introduced in this work. The inviscid flows passing through a channel with circular arc bump, and the laminar flows over a flat plate with/without shock interaction are investigated to confirm the accuracy, convergence and solution-adaptibility of the numerical approach. To further prove the reliability and capability of the present solution procedure, the inviscid/viscous results for flows over the NACA 0012 airfoil, NACA 65-(12)10 compressor and one advanced transonic turbine cascade are compared to the numerical and experimental data given in related papers and reports.

show abstract

Section: Code Validationmentioning

confidence: 76%

Inviscid and Viscous Solutions for Airfoil/Cascade Flows Using a Locally Implicit Algorithm on Adaptive Meshes

Hwang

Liu

1990

Volume 1: Turbomachinery

View full text Add to dashboard Cite

show abstract

“…The principle behind this algorithm is that the errors associated with the high frequencies are annihilated by a carefully chosen smoother (a multi-stage Runge-Kutta scheme) while the errors associated with the low frequencies are annihilated on the coarser grids where these frequencies manifest themselves as high frequencies. [8] and Batina [9]. Venkatakrishnan [10] has tested preconditioned iterative methods on structured grid problems with special emphasis on vector performance issues.…”

Section: Introductionmentioning

confidence: 99%

Implicit Solvers for Unstructured Meshes

Venkatakrishnan

Mavriplis

1993

Journal of Computational Physics

119

View full text Add to dashboard Cite

“…Con esto se consigue reducir el coste de discretización lo máximo posible, al utilizar celdas más complejas, y aumentar la precisión en las zonas con alargamiento [AGT94]. Los métodos de mallas no estructuradas permiten el uso de mallas mixtas y ha sido abordado por diferentes autores [SVD89], [Bar90], [CSL95]. Sin embargo añade una gran complejidad en los algoritmos a utilizar en la discretización debido a que la estructura de datos con diferentes tipos de elementos no es homogénea.…”

Section: Mallas Estructuradas O No Estructuradasunclassified

“…Una simplificación común es remplazar la linealización exacta por otra basada en una discretización de primer orden [SVD89], [VM93]. Mientras ésto reduce considerablemente los requerimientos de almacenaje del sistema lineal y mejora sus condiciones, impide conseguir una convergencia cuadrática debido al uso de una linealización inexacta.…”

Section: Métodos Implícitosunclassified

“…No obstante, hay que determinar criterios rigurosos para determinar el nivel óptimo de convergencia del sistema lineal en cada paso de tiempo. Métodos iterativos simples tales como los métodos de Jacobi o de Gauss-Seidel se han utilizado con éxito en el contexto de métodos imphcitos con linealizaciones de primer orden [SVD89]. Sin embargo su convergencia se degrada con el tamaño de la malla.…”

Section: Métodos Implícitosunclassified

See 1 more Smart Citation

Una estructura de datos basada en aristas para la resolución de las ecuaciones de Navier-Stokes

Miguel¹

View full text Add to dashboard Cite

This vvork presents an edge-based data structure, that allows to get numerical solutions of Euler and Navier-Stokes equations, indepeiidently of the selected mesh type to discretize the computational domain. This mains, the code wiU reach a grid-transparent property. Based on this data structure a complete solution technique has been formulated, which allows to handle structured grids, block structured grids, and unstructured grids of tetrahedra or mixed elements vvithout any modification. The use of mixed elements in order to build the mesh in a discrete domain is not new. The contribution of the work hes in the posibiUty of unbinoing the needed information to solve the equations from the geometric data and original dimention of the mesh. This is achieved by means of a pre-process where a new lineal structure is build. AUocating original geometric data to the mesh edges, subsequent references to the original grid are not needed.A efEccient data structure has been constructed, minimize memory overhead and minimize amount of gather scatter, in comparation to others structures (element-based or face-based).

show abstract

An adaptive grid polygonal finite volume method for the compressibleflow equations

Cited by 10 publications

References 2 publications

Inviscid and Viscous Solutions for Airfoil/Cascade Flows Using a Locally Implicit Algorithm on Adaptive Meshes

Inviscid and Viscous Solutions for Airfoil/Cascade Flows Using a Locally Implicit Algorithm on Adaptive Meshes

Implicit Solvers for Unstructured Meshes

Una estructura de datos basada en aristas para la resolución de las ecuaciones de Navier-Stokes

Contact Info

Product

Resources

About