1. 13 Oct, 2015 1 commit
  2. 06 Aug, 2015 2 commits
  3. 05 Aug, 2015 2 commits
  4. 04 Aug, 2015 1 commit
  5. 02 Aug, 2015 1 commit
  6. 01 Aug, 2015 4 commits
  7. 24 Jul, 2015 2 commits
  8. 21 Jul, 2015 1 commit
  9. 20 Jul, 2015 1 commit
  10. 19 Jul, 2015 6 commits
  11. 18 Jul, 2015 1 commit
  12. 17 Jul, 2015 4 commits
  13. 16 Jul, 2015 2 commits
  14. 15 Jul, 2015 4 commits
  15. 14 Jul, 2015 1 commit
    • 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
  16. 12 Jul, 2015 2 commits
    • 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
  17. 05 Jul, 2015 1 commit
  18. 03 Jul, 2015 2 commits
  19. 02 Jul, 2015 1 commit
  20. 01 Jul, 2015 1 commit