CLSVOF - Revision history

Mkm06: /* Serial Algorithm */

2014-04-25T01:55:45Z

‎Serial Algorithm

Mkm06: CLSVOF is in the process of being implemented within PHASTA. The single-element algorithms have been developed and tested in Matlab. The serial algorithm is being developed and tested within PHASTA. Parallel development will follow.

2014-04-11T20:52:38Z

CLSVOF is in the process of being implemented within PHASTA. The single-element algorithms have been developed and tested in Matlab. The serial algorithm is being developed and tested within PHASTA. Parallel development will follow.

Mkm06 at 20:43, 11 April 2014

2014-04-11T20:43:10Z

Mkm06 at 20:34, 11 April 2014

2014-04-11T20:34:54Z

Mkm06: /* Serial Algorithm */

2013-10-29T18:51:43Z

‎Serial Algorithm

Mkm06 at 18:41, 29 October 2013

2013-10-29T18:41:59Z

Mkm06 at 18:59, 22 October 2013

2013-10-22T18:59:23Z

Mkm06 at 18:52, 22 October 2013

2013-10-22T18:52:44Z

Mkm06 at 18:52, 22 October 2013

2013-10-22T18:52:19Z

Mkm06 at 18:50, 22 October 2013

2013-10-22T18:50:58Z

@@ Line 23: / Line 23: @@
    Need to temporarily store the normal
-There are 7 possible cases for φ in a cell with 0 < VOF < 1:
+There are 2 possible cases for φ in a cell with 0 < VOF < 1:
 .(L)  All nodal φ are the same sign - use smallest φ and assume interface plane is parallel to opposite face
-.(L)  1 node φ=0, other nodes are all the same sign - assume interface plane is parallel to opposite face
+.(I)  All φ are different signs
 '''3.b.'''(I)  Move interface along normal until computed F = advected F

← Older revision		Revision as of 20:52, 11 April 2014
Line 1:		Line 1:
−
	== '''Introduction''' ==		== '''Introduction''' ==
	CLSVOF is a coupled level set - volume of fluid method. The method corrects the level set to make it locally (for each element containing the interface) volume conserving.		CLSVOF is a coupled level set - volume of fluid method. The method corrects the level set to make it locally (for each element containing the interface) volume conserving.

← Older revision		Revision as of 20:43, 11 April 2014
Line 1:		Line 1:
−	~~A coupled level set volume of fluid method is being implemented in the incompressible code for interface tracking.~~

		+	== '''Introduction''' ==
		+	CLSVOF is a coupled level set - volume of fluid method. The method corrects the level set to make it locally (for each element containing the interface) volume conserving.

	== '''Serial Algorithm''' ==		== '''Serial Algorithm''' ==

@@ Line 2: / Line 2: @@
-== Serial Algorithm ==
+== '''Serial Algorithm''' ==
 '''Loop over elements''' (find the elements containing interface pieces)
@@ Line 142: / Line 142: @@
 '''When list is empty, for all elements not tagged as reconstructed, φ = nε for all nodes not tagged as reconstructed'''
-== Parallel Algorithm ==
+== '''Parallel Algorithm''' ==

@@ Line 15: / Line 15: @@
 '''3.'''(C)  If 0 < F < 1 (element contains interface)
-'''3.a.'''  Use advected φ at element nodes to find interface slope for the element
+'''3.a.'''(I)  Use advected φ at element nodes to find interface slope for the element
    For tetrahedra, find the points at which the interface intersects the edges

@@ Line 5: / Line 5: @@
 '''Loop over elements''' (find the elements containing interface pieces)
-'''1.'''  Tag each element as incomplete
+'''1.'''(I)  Tag each element as incomplete
    Need a tag for elemental completeness
-'''2.'''  Truncate volume fractions so they’re 0 ≤ F ≤ 1
+'''2.'''(C)  Truncate volume fractions so they’re 0 ≤ F ≤ 1
    Volume fraction is the second scalar
-'''3.'''  If 0 < F < 1 (element contains interface)
+'''3.'''(C)  If 0 < F < 1 (element contains interface)
 '''3.a.'''  Use advected φ at element nodes to find interface slope for the element
@@ Line 23: / Line 25: @@
 There are 7 possible cases for φ in a cell with 0 < VOF < 1:
-.  All nodal φ are the same sign - use smallest φ and assume interface plane is parallel to opposite face
+.(L)  All nodal φ are the same sign - use smallest φ and assume interface plane is parallel to opposite face
-.  1 node φ=0, other nodes are all the same sign - assume interface plane is parallel to opposite face
+.(L)  1 node φ=0, other nodes are all the same sign - assume interface plane is parallel to opposite face
-.  1 node φ=0, other nodes are different signs
+.(L)  1 node φ=0, other nodes are different signs
-.  2 nodal φ=0, others are the same sign
+.(L)  2 nodal φ=0, others are the same sign
-.  2 nodal φ=0, others are different signs
+.(L)  2 nodal φ=0, others are different signs
-.  3 nodal φ=0
+.(I)  3 nodal φ=0
-.  All φ are different signs
+.(I)  All φ are different signs
-'''3.b.'''  Move interface along normal until computed F = advected F
+'''3.b.'''(I)  Move interface along normal until computed F = advected F
 Cases 3, 5, and 7 above have the interface plane passing through the element. (Cases 1, 2, 4, and 6 are degenerate cases.)  When the element is divided by the interface plane, the resulting volumes are either 1 tetrahedron and 1 pentahedron (interface plane intersects 3 edges) or 2 pentahedra (interface plane intersects 4 edges).
-Figure out which side of the interface is a tetrahedron.  F is either the volume of the interface tetrahedron or the volume of the element minus the interface tetrahedron.
+(A) Figure out which side of the interface is a tetrahedron.  F is either the volume of the interface tetrahedron or the volume of the element minus the interface tetrahedron.
    For a tetrahedron with vertices '''a''', '''b''', '''c''', and '''d''', the volume is:  <math>V = \frac { |(\mathbf{a}-\mathbf{d}) \cdot ((\mathbf{b}-\mathbf{d}) \times (\mathbf{c}-\mathbf{d}))| } {6}.</math>
 When there are two pentahedra, the volume of either one can be found by dividing it into two tetrahedra and a 5-sided pyramid.  The vertices of each tetrahedron are an element vertex, two points where the interface plane intersects element edges, and the midpoint of an element edge not intersected by the interface plane.  The vertices of the pyramid are the four points where the interface plane intersects the element edges and the midpoint of an element edge not intersected by the interface plane.
@@ Line 50: / Line 52: @@
 After each movement of the interface, the LS=0 points on the edges have to be found again, and the volume recomputed.  When the computed volume fraction is within a tolerance of the actual volume fraction, the new interface has been found, and the nodes can be updates.
-'''3.c.'''  Use the newly established interface to compute φ at each node and tag those nodes as reconstructed
+'''3.c.'''(I)  Use the newly established interface to compute φ at each node and tag those nodes as reconstructed
    At each node, φ is the distance to the nearest point, unless two points are equidistant.
    Need a tag for nodal completeness/reconstruction
-'''3.d.'''  If any node has already been reconstructed, φ is min (previous reconstruction, current reconstruction) (ensure that φ is min to interface everywhere)
+'''3.d.'''(A)  If any node has already been reconstructed, φ is min (previous reconstruction, current reconstruction) (ensure that φ is min to interface everywhere)
-'''3.e.'''  Mark the element as complete
+'''3.e.'''(A)  Mark the element as complete
 '''3.f.'''  Loop over elements adjacent by shared faces - If it’s not marked as complete and not an interface element, add it to the reconstruction list

@@ Line 47: / Line 47: @@
 Shashkov uses a line search algorithm to adjust the interface.  -> Use a recursive bisection.
-After each movement of the interface, the LS=0 points on the edges have to be found again (for computing volume)
 '''3.c.'''  Use the newly established interface to compute φ at each node and tag those nodes as reconstructed