ViennaLS
Loading...
Searching...
No Matches
lsStencilLocalLaxFriedrichsScalar.hpp File Reference
#include <hrleSparseBoxIterator.hpp>
#include <hrleVectorType.hpp>
#include <lsDomain.hpp>
#include <lsExpand.hpp>
#include <lsFiniteDifferences.hpp>
#include <lsVelocityField.hpp>

Go to the source code of this file.

Classes

class  lsInternal::StencilLocalLaxFriedrichsScalar< T, D, order >
 Stencil Local Lax Friedrichs Integration Scheme. It uses a stencil of order around active points, in order to evaluate dissipation values for each point, taking into account the mathematical nature of the speed function. see Toifl et al., 2019. ISBN: 978-1-7281-0938-1; DOI: 10.1109/SISPAD.2019.8870443. More...
 

Namespaces

namespace  lsInternal
 
namespace  lsInternal::advect
 
namespace  viennals
 

Functions

template<class IntegrationSchemeType , class T , int D, lsConcepts::IsNotSame< IntegrationSchemeType, lsInternal::StencilLocalLaxFriedrichsScalar< T, D, 1 > > = lsConcepts::assignable>
void lsInternal::advect::reduceTimeStepHamiltonJacobi (IntegrationSchemeType &, double &, hrleCoordType)
 
template<class T , int D>
void viennals::PrepareStencilLocalLaxFriedrichs (std::vector< SmartPointer< Domain< T, D > > > &levelSets, std::vector< bool > isDepo)
 This function creates the specialized layer wrapping which produces better results for the SSLF integration scheme. isDepo must contain whether the corresponding level sets are used for deposition or not. This function assumes that the layers where deposition is not possible represent only masking layers and are not wrapped around other depo layers. Hint: Sometimes it is useful to introduce a new mask layer combining all masking materials and remove it after advection instead of trying to deal with numerous separate masking layers.
 
template<class T , int D>
void viennals::FinalizeStencilLocalLaxFriedrichs (std::vector< SmartPointer< Domain< T, D > > > &levelSets)
 After advection using the SLLF layer wrapping approach is done, restore the original layer wrapping used everywhere else.