Skip to content
Snippets Groups Projects
  1. Aug 10, 2015
  2. Aug 08, 2015
  3. Aug 07, 2015
  4. Aug 06, 2015
  5. Aug 05, 2015
  6. Aug 04, 2015
  7. Aug 02, 2015
  8. Aug 01, 2015
  9. Jul 24, 2015
  10. Jul 21, 2015
  11. Jul 20, 2015
  12. Jul 19, 2015
  13. Jul 18, 2015
  14. Jul 17, 2015
  15. Jul 16, 2015
  16. Jul 15, 2015
  17. Jul 14, 2015
    • Henry Weller's avatar
      cellCoBlended: New surfaceInterpolation scheme based on CoBlended using the... · da8db9ff
      Henry Weller authored
      cellCoBlended: New surfaceInterpolation scheme based on CoBlended using the cell-based Courant number
      
          This scheme is equivalent to the CoBlended scheme except that the Courant
          number is evaluated for cells using the same approach as use in the
          finite-volume solvers and then interpolated to the faces rather than being
          estimated directly at the faces based on the flux.  This is a more
          consistent method for evaluating the Courant number but suffers from the
          need to interpolate which introduces a degree of freedom.  However, the
          interpolation scheme for "Co" is run-time selected and may be specified in
          "interpolationSchemes" and "localMax" might be most appropriate.
      
          Example of the cellCoBlended scheme specification using LUST for Courant
          numbers less than 1 and linearUpwind for Courant numbers greater than 10:
          \verbatim
          divSchemes
          {
              .
              .
              div(phi,U)  Gauss cellCoBlended 1 LUST grad(U) 10 linearUpwind grad(U);
              .
              .
          }
      
          interpolationSchemes
          {
              .
              .
              interpolate(Co) localMax;
              .
              .
          }
          \endverbatim
      da8db9ff
  18. Jul 12, 2015
    • Henry Weller's avatar
    • Henry Weller's avatar
      blockMesh: added experimental fast-merge algorithm · 171c25ab
      Henry Weller authored
      The standard merge-algorithm is N^2 over the face-points and uses a
      geometric proximity test for the merge.  These are both choices for
      implementation simplicity and are rather inefficient for large meshes.
      I have now implemented an experimental linear topological merge
      algorithm which is VERY fast and effective for meshes of any size.
      Currently it will merge internal faces on meshes of arbitrary complexity
      but does not yet handle edge or face collapse needed for wedges and
      other degenerate blocks.
      
      The new fast-merge algorithm may be selected using the optional
      "fastMerge" entry:
      
      fastMerge yes;
      
      and if not present the standard N^2 algorithm will be used.
      
      Henry G. Weller
      CFD Direct
      171c25ab
  19. Jul 05, 2015
  20. Jul 03, 2015