Implicit FEM-FCT algorithm for compressible flows

Matthias Möller (), Dmitri Kuzmin and Stefan Turek
Additional contact information
Matthias Möller: University of Dortmund, Institute of Applied Mathematics (LSIII)
Dmitri Kuzmin: University of Dortmund, Institute of Applied Mathematics (LSIII)
Stefan Turek: University of Dortmund, Institute of Applied Mathematics (LSIII)

A chapter in Numerical Mathematics and Advanced Applications, 2004, pp 641-650 from Springer

Abstract: Summary The flux-corrected transport (FCT) methodology is generalized to implicit finite element schemes and applied to the Euler equations of gas dynamics. The underlying low-order scheme is constructed by applying scalar artificial viscosity proportional to the spectral radius of the cumulative Roe matrix. All conservative matrix manipulations are performed edge-by-edge which leads to an efficient algorithm for the matrix assembly. The outer defect correction loop is equipped with a block-diagonal preconditioner so as to decouple the discretized Euler equations and solve all equations individually. As an alternative, a strongly coupled solution strategy is investigated in the context of stationary problems which call for large time steps.

Keywords: Euler Equation; Compressible Flow; Large Time Step; Artificial Viscosity; Finite Element Scheme (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-18775-9_62

Ordering information: This item can be ordered from
http://www.springer.com/9783642187759

DOI: 10.1007/978-3-642-18775-9_62

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().