Skip to main content

A Discontinuous Galerkin Method on Arbitrary Grids with High Order Boundary Discretization

  • Conference paper
  • First Online:
The Proceedings of the 2018 Asia-Pacific International Symposium on Aerospace Technology (APISAT 2018) (APISAT 2018)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 459))

Included in the following conference series:

  • 101 Accesses

Abstract

In this paper a numerical solution method for compressible Euler equations on arbitrary grids with high order boundary elements, based on discontinuous Galerkin space discretization, is presented. Unstructured grids with both triangular and quadrilateral elements are utilized, which contain high order curved edge elements near wall boundary and low order straight edge elements elsewhere. In this study, the polynomial basis functions up to third order are utilized, and the inter cell fluxes are calculated with HLLC approximate Riemann solver. This paper includes steady state results for a circular cylinder flow in two dimensions, the results are compared with different grids and different boundary discretization orders. The accuracy of this method as well as the needs of high order boundary discretization are demonstrated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Reed WH, Hill TR (1973) Triangular mesh methods for the neutron transport equation. Los Alamos Scientific Laboratory Report, LA-UR-73-479

    Google Scholar 

  2. Bassi F, Rebay S (1997) High-order accurate discontinuous finite element solution of the 2D Euler equations. J Comput Phys 138:215–285

    Article  MathSciNet  Google Scholar 

  3. Xia Y, Luo H, Spiegel S, Frisbey M (2013) A parallel implicit reconstructed discontinuous Galerkin method for the compressible flows on 3D arbitrary grids. In: 21st AIAA computational fluid dynamics conference, AIAA 2013-3062

    Google Scholar 

  4. Toro EF (2009) Riemann solvers and numerical methods for fluid dynamics-a practical introduction. Springer, New York

    Book  Google Scholar 

  5. Luo H, Baum JH, Lohner R (2006) A fast, p-multigrid discontinuous Galerkin method for compressible flows at all speeds. In: 44th AIAA Aerospace sciences meeting and exhibit, AIAA 2006-110

    Google Scholar 

  6. Krivodonova L, Berger M (2006) High-order accurate implementation of solid wall boundary conditions in curved geometries. J Comput Phys 211:492–512

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Penghui Su .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Su, P., Zhang, L. (2019). A Discontinuous Galerkin Method on Arbitrary Grids with High Order Boundary Discretization. In: Zhang, X. (eds) The Proceedings of the 2018 Asia-Pacific International Symposium on Aerospace Technology (APISAT 2018). APISAT 2018. Lecture Notes in Electrical Engineering, vol 459. Springer, Singapore. https://doi.org/10.1007/978-981-13-3305-7_48

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-3305-7_48

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-3304-0

  • Online ISBN: 978-981-13-3305-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics