Procedures

Coefficient alpha from the recursive formulation of Legendre polynomials, for the Legendre mode 'mode'.

Prodcut of alpha(numerator) * beta(denominator) / alpha(denominator) as needed by the Clenshaw algorithm in ply_split_legendre_matrix.

Quotient of two alpha values.

This routine convert plane to triangle and add triangle to growing array and add position of triangle into spatialObj%primitive_position

This routine convert box to planes and then planes to triangles and add triangle to growing array and add position of triangle into spatialObj%primitive_position

This routine convert canonical line to seeder line array

This routine convert plane to triangle and add triangle to growing array and add position of triangle into spatialObj%primitive_position

This routine convert canonical point to seeder point array

This routine single cylinder from object table

Coefficient beta from the recursive formulation of Legendre polynomials, for the Legendre mode 'mode'.

This routine checks if neighbor node with intersected boundary is level higher than current node level.

Copy the FPT header information.

This routine append 8 children to protoTree and inherit property bits from parent. leaf bit is removed from parent.

This routine creates children for each parent if children intersect with boundary object.

Routine to create an element with subelement resolution.

Mark all virtual nodes, which contain a flooded child as flooded starting from the second finest level moving up to the root. This allows to easily avoid non-flooded domains later on.

This routine loops over all intersected with geoemtry nodes and fluidify some node according to the following rule:\n 1. one of its link does noe intersect with any geometry that requires qVal 2. it has fluid neighbor on that direction. i.e. it is wet in that side. Jiaxing Qi

This routine checks for qVal of the periphery and floods if qVal < 0 and the node in that direction is fluid and not intersected by boundary

This routine loop over all nodes are flood non-interesting leaf node with wet face and inherit the wetness of the virtual node to the eligble childrens

Get sampled data.

This routine gets minBCID of the given node position in the protoTree. If the minBcid is periodic then it bcID is set to treeID of fluid node on the opposite side of periodic plane. It also computes the qVal if calc_dist = true. If qVal = -1 then there is no intersection and if qVal > 1 then the geometry is intersected after the link distance.

Obtain the surface normal of the chosen boundary if the boundary has store_normal set. Otherwise a null vector is returned.

This function returns the position of treeID of given coordReal in the the given mesh Start from minLevel which is the level of neighbor and find the treeID which is a leaf in protoTree

This routine inherit the intersected boundary objects from parent to childrens

Test the intersection between the given cube and the object specified by obj_pos.

This function provides the test for equality of the header for two projections.

This function provides the test for equality of two projections.

This function provides the test for equality of two projections.

This function provides the test for equality of two projections.

This function provides the test for equality of two nodes descriptions.

This function provides a > comparison of the header of two projections.

This function provides a > comparison of two projections.

This function provides a > comparison of two projections.

This function provides a > comparison of two projections.

This function provides a > comparison of nodes descriptions.

This function provides a >= comparison of the header of two projections.

This function provides a >= comparison of two projections.

This function provides a >= comparison of two projections.

This function provides a >= comparison of two projections.

This function provides a >= comparison of two nodes descriptions.

This function provides a < comparison of the header of two projections.

This function provides a < comparison of two projections.

This function provides a < comparison of two projections.

This function provides a < comparison of two projections.

This function provides a < comparison of two nodes descriptions.

This function provides a <= comparison of the header of two projections.

This function provides a <= comparison of two projections.

This function provides a <= comparison of two projections.

This function provides a <= comparison of two projections.

This function provides a <= comparison of two nodes descriptions.

This function provides the test for unequality of the header of two projections.

This function provides the test for unequality of two projections.

This function provides the test for unequality of two projections.

This function provides the test for unequality of two projections.

This function provides the test for unequality of two nodes descriptions.

Load the value fill definition for a single color.

Small helping routine to keep track of leaf nodes.

This routine checks if a boundary need calc qVal for a given BCID It is used in identify_boundary routine

This routine checks if a boundary need flood periphery for diagonal directions for a given BCID. It is used in identify_boundary routine

Coefficients from the recursive formulation of legendre polynomials. L_n = alpha * x * L_n-1 + beta * L_n-2

Prodcut of alpha(numerator) * beta(denominator) / alpha(denominator)

Quotient of two alpha values.

Coefficients from the recursive formulation of legendre polynomials. L_n = alpha * x * L_n-1 + beta * L_n-2

Subroutine to convert linearized dof index to ansatz function number for Q-Polynomials.

Loading parameters for the filtering from the configuration script. This needs to be performed before any call of the actual transformation ply_split_element_1D.

Filter a polynomial representation in elements in one dimension according to its odd mode fraction.

Filter one-dimensional elements of degree element_degree.

Filter two-dimensional elements of degree element_degree.

Filter three-dimensional elements of degree element_degree.

Define settings for the Fast Polynomial Transformation.

Print the FPT settings to the log output.

Read the FPT configuration options from the provided Lua script in conf.

Write FPT settings into a Lua table.

Load settings to describe a projection method from a Lua table.

Write FXT settings into a Lua table.

Convert modal data to nodal data in 1D using flpt.

Convert modal data to nodal data in 2D using flpt.

Convert modal data to nodal data in 3D using flpt.

Convert nodal data to modal data using flpt.

subroutine to create gauss points and weights for one-dimensional integration on the interval [x1,x2].

Create Gauss-Legendre integration points and weights for one-dimensional integration on the interval [x1,x2].

Initialize the flpt data structure for fast legendre polynomial transformation via the fxtpack.

Initialize the transformations via L2 projections.

Subroutine to initialize the fast polynomial transformation for Legendre expansion.

Routine to initialize the projection coefficients for a usage in the subsampling routine to project degrees of freedoms of a parent cell to the degrees of freedoms of a child cell if the degrees of freedoms are Q-Legendre polynomials.

Actual implementation of the matrix operation to change between nodal and modal representations.

Load settings to describe a projection method from a Lua table.

Write L2P settings into a Lua table.

Transformation between modal and nodal values in 1D via L2 projection.

Transformation between modal and nodal values in 2D via L2 projection.

Transformation between modal and nodal values in 3D via L2 projection.

Define a new polynomial in the Lagrange basis.

Evaluate a polynomial in the Lagrange basis at some point x.

Evaluate the given Lagrangian mode (which is 1 at coord(mode) and 0 in all other points) at a given point x.

Subroutine to convert Chebyshev (A) to Legendre (B) coefficients.

Subroutine to transform Legendre expansion to point values at Chebyshev-Lobatto nodes.

Vectorizing subroutine to transform Legendre expansion to point values at Chebyshev-Lobatto nodes.

Subroutine to transform Legendre expansion to point values at Chebyshev nodes.

Vectorizing subroutine to transform Legendre expansion to point values at Chebyshev nodes.

Evaluate a given set of Legendre polynomials a given set of 1D points.

Initialize points with the Chebyshev quadrature points, 3D

Create the integration points on the surface of (cubical) elements.

Create multidimensional points from given 1D set of nodes in the cubic reference element.

Generates a given number of Chebyshev-Lobatto points on the unit interval [-1;+1].

Generates a given number of Chebyshev points on the unit interval [-1;+1].

Compute Gauss-Legendre integration points on the interval [-1,1].

Subroutine to transform point values at Chebyshev-Lobatto nodes to a Legendre expansion.

Vectorizing subroutine to transform point values at Chebyshev-Lobatto nodes to a Legendre expansion.

Subroutine to transform point values at Chebyshev nodes to a Legendre expansion.

Vectorizing subroutine to transform point values at Chebyshev nodes to a Legendre expansion.

Compute a multi-dimensional tensor for the given set of nodes.

Projection of polynomial data from parent elements to child elements. The projection is done by a direct transformation of the modal coeffiecients to another coordinate system with z=ax+b.

Load settings to describe a projection method from a Lua table.

Load settings to describe a projection method from a Lua table.

Subroutine to project elemental data from a parent cell to one of its children.

Subroutine to project element data from a parent cell to its children.

Routine to create one-dimensional projection coefficient for a coarse element to a fine element.

Function to calculate the squared L2-Norm of a given Legendre polynomial on the reference element [-1,+1].

Subsampling by L2-Projection of the Q-Tensorproduct Legendre polynomials.

Sample data described by varsys in orig_mesh according to the tracking object trackInst with adaptive refinements.

Initialize the sampled tracking entities.

Output sampled tracking data.

Load the configuration of sampled tracking objects.

Load the configuration for adaptive subsampling.

Allocate memory for a sampled variable.

This routine computes for each element whether the solution in it is considered to be deviating from the mean above the given threshold or not. The logical result is stored in var%deviates for each element.

Move the variable data from source to destination.

Create a variable system for the given tracking instance.

Split one-dimensional elements of degree parent_degree into two elements with polynomials of degree child_degree.

Testing the 1D splitting.

Split two-dimensional elements of degree parent_degree into four elements with polynomials of degree child_degree.

Testing the 2D splitting.

Split three-dimensional elements of degree parent_degree into eight elements with polynomials of degree child_degree.

Testing the 3D splitting.

Initialization of the module. This needs to be performed before any call of the actual transformation ply_split_element_1D.

Project a polynomial representation in elements in one dimension to its two halves in that direction.

Testing routine for the functions of this module.

Compute the transformation matrix for a projection to the left and right half-interval of Legendre polynomials for the given maximal number of modes.

A small testing routine to check the functions of this module.

Get the color of an element.

Get the subresolution data for all elements for a given color and in the requested format.

Subroutine to load subresolution information for a given tree.

Routine to subsample mesh information for one refinement level.

Compute the transformation matrix for a projection to the left and right half-interval of Legendre polynomials for the given maximal number of modes.

This function project given vector on an given plane

Routine to convert protoTree to Treelm data format. append all leaves to the temData%treeID

Small helping routine to get the variable data from a leaf.

Setup timers to assess the runtime of various parts of Seeder

This routine created sphere objects and new attribute and extend a list of spatial objects if node intersected boundary has distance refine.

This routine builds the preliminary tree with geometry intersection and neighbor identification

Get the color at all given points.

This routine dumps the final fluid tree leaves in the disk

Performance results are written to a file for statistical review

This routine find the treeID on the opposite side neighbor of the periodic plane for current leaf node

This routine identifies the nodes, which are supposed to be part of the computational domain, as defined by the seed objects.

Read the configuration for the Seeder harvesting from a Lua script.

Clean up the properties data type.

Import subresolved color data.

Load the properties from the mesh.

This routine checks for boundary neighbors and level of the boundary node

This routines inherit distance refine sphere object from root node down to leaf node. Only the object with level greater than node level are inHerited

Prominently let the user now, what he actually is running right now.

This routine loads canonical geometrial objects like point, line, plane and box and add them to the growing array of each primitive geometries and the position of this geometries are stored in the growing array of spatialObject

Load the configuration from the Lua script provided on the command line or from seeder.lua by default, if no file name is given as program argument.

This routine loads the boundCube table from config file

\brief Loading cylinder information from config file \n

This routine loads the deformation table from transformation table

Load ellipsoid information from config file.

This routine loads the geometry table from the config file i.e loading different geometry kinds like canoND, cube, periodic, STL etc.

This routine reads a single geometry table from the config file i.e loading different geometry kinds like canoND, cube, periodic, STL etc.

Routine to load spatial object defined in config file and store in geometry type

Routine to load single spatial object table defined in config file

Load sphere information from config file.

This routine loads STL files from config and reads the triangles from the files into the dynamic array of triangles.

This routine loads the transformation table for each spatial object table in config file

This routine loads the translation table from transformation table

Load triangle information from config file.

This routine marks 26 direct neighbors as has boundary bit

Find the neighbor position in protoTree for iDir on the same level or on any one above.

This routine identifies the 6 direct neighbors of a node in the prototree

This subroutine creates the treelmesh from the flooded prototree.

This routine computes the minimum distance of a given link and all the geometries in a given node:\n the link is given by a vector and a origin point.\n the node is given by the node position in the protoTree.\n If there is no intersection, qVal returns -1.0

This routine extends the protoTree with max of minlevel or level of refinement object.

This routine smoothens fluid domain with maximum level jumps of 1.

Add a value definition for a color to the list of fillings.

Load the filling definition for subresolved colors.

Find the value definitions for all unique colors.

Loading the settings for the subresolution in the mesh.

This routine apply transformations to canonical objects

This routine gives special treatment when qVal > 1.0 or qVal == -1.0 for flooded neighbor, treat it as normal fluid: clean BCID, set qVal to -1 (no itersection). for non-flooded neighbor, treat it as high order wall: set qVal to 1

Write current leaves of the prototree as treelm restart.

Internal subroutine to load the list of colors, which by default should apply subelement resolution to its boundaries.

This routine apply transformation to canonical objects.

This routine apply transformation to canonical objects.

Recursively traverse the tree in a depth first manner to obtain the the ordering required by treelm.

Small helping routine to write leaves in order into a treelmesh formatted file.