m (Cinmemj moved page Draft Samper 712506882 to Lohner et al 2008b)
 
(2 intermediate revisions by the same user not shown)
Line 10: Line 10:
 
<li>automatic deactivation of quiescent regions; and</li>
 
<li>automatic deactivation of quiescent regions; and</li>
  
<li>unstructured grids with cartesian cores or embedded cartesian grids.</li>
+
<li>unstructured grids with cartesian cores or embedded cartesian grids.</li></ul><br>
  
The results from several examples demonstrate that speedup factors of 1:4 are attainable without compromising the accuracy of the traditional FCT schemes.  
+
The results from several examples demonstrate that speedup factors of 1:4 are attainable without compromising the accuracy of the traditional FCT schemes.
  
 
==Full Document==
 
==Full Document==
  
 
<pdf>Media:Draft_Samper_712506882_6753_fld.1598.pdf</pdf>
 
<pdf>Media:Draft_Samper_712506882_6753_fld.1598.pdf</pdf>

Latest revision as of 15:47, 1 July 2020

Abstract

Several explicit high‐resolution schemes for transient compressible flows with moving shocks are combined in such a way so as to achieve the highest possible speed without compromising accuracy. The main algorithmic changes considered comprise the following:

  • replacing limiting and approximate Riemann solvers by simpler schemes during the initial stages of Runge–Kutta solvers, and only using limiting and approximate Riemann solvers for the last stage;
  • automatically switching to simpler schemes for smooth flow regions;
  • automatic deactivation of quiescent regions; and
  • unstructured grids with cartesian cores or embedded cartesian grids.

The results from several examples demonstrate that speedup factors of 1:4 are attainable without compromising the accuracy of the traditional FCT schemes.

Full Document

The PDF file did not load properly or your web browser does not support viewing PDF files. Download directly to your device: Download PDF document
Back to Top

Document information

Published on 01/01/2008

DOI: 10.1002/fld.1598
Licence: CC BY-NC-SA license

Document Score

0

Views 1
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?