|
IBAMR
IBAMR version 0.19.
|
Class IBInterpolantMethod is an implementation of the abstract base class IBStrategy that provides a simple functionality of interpolating and spreading scalar or vector-valued quantities to and from the moving IB structure on the background Cartesian grid. More...
#include <ibamr/IBInterpolantMethod.h>

Public Member Functions | |
| IBInterpolantMethod (std::string object_name, SAMRAI::tbox::Pointer< SAMRAI::tbox::Database > input_db, int no_structures=1, bool register_for_restart=true) | |
| Constructor. More... | |
| ~IBInterpolantMethod () | |
| Destructor. More... | |
| void | registerEulerianVariables () override |
| void | registerEulerianCommunicationAlgorithms () override |
| virtual void | registerVariableAndHierarchyIntegrator (const std::string &var_name, const int var_depth, SAMRAI::tbox::Pointer< SAMRAI::hier::Variable< NDIM > > variable, SAMRAI::tbox::Pointer< IBTK::HierarchyIntegrator > hier_integrator) |
| Register a variable and the HierarchyIntegrator managing the variable with this class. More... | |
| void | registerLInitStrategy (SAMRAI::tbox::Pointer< IBTK::LInitStrategy > l_initializer) |
| void | freeLInitStrategy () |
| IBTK::LDataManager * | getLDataManager () const |
| int | getStructuresLevelNumber () const |
| Get the level on which the structures reside. More... | |
| int | getStructureHandle (const int lag_idx) const |
| Get the structure handle to which this Lagrangian index belongs. More... | |
| unsigned int | getNumberOfNodes (const unsigned int struct_no) const |
| Get the number of nodes for this structure. More... | |
| void | registerLSiloDataWriter (SAMRAI::tbox::Pointer< IBTK::LSiloDataWriter > silo_writer) |
| const SAMRAI::hier::IntVector< NDIM > & | getMinimumGhostCellWidth () const override |
| void | setupTagBuffer (SAMRAI::tbox::Array< int > &tag_buffer, SAMRAI::tbox::Pointer< SAMRAI::mesh::GriddingAlgorithm< NDIM > > gridding_alg) const override |
| void | preprocessIntegrateData (double current_time, double new_time, int num_cycles) override |
| void | postprocessIntegrateData (double current_time, double new_time, int num_cycles) override |
| void | interpolateVelocity (int u_data_idx, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::CoarsenSchedule< NDIM > > > &u_synch_scheds, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::RefineSchedule< NDIM > > > &u_ghost_fill_scheds, double data_time) override |
| void | interpolateQ (double data_time) |
| void | interpolateQ () |
| void | forwardEulerStep (double current_time, double new_time) override |
| void | backwardEulerStep (double current_time, double new_time) override |
| void | midpointStep (double current_time, double new_time) override |
| void | trapezoidalStep (double current_time, double new_time) override |
| void | updateMeshPosition (double current_time, double new_time, const std::vector< Eigen::Vector3d > &U, const std::vector< Eigen::Vector3d > &W) |
| void | computeLagrangianForce (double data_time) override |
| void | spreadForce (int f_data_idx, IBTK::RobinPhysBdryPatchStrategy *f_phys_bdry_op, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::RefineSchedule< NDIM > > > &f_prolongation_scheds, double data_time) override |
| void | spreadQ (double data_time) |
| int | getEulerianQPatchDataIndex (const std::string &var_name) |
| void | copyEulerianDataToIntegrator (double data_time) |
| void | initializePatchHierarchy (SAMRAI::tbox::Pointer< SAMRAI::hier::PatchHierarchy< NDIM > > hierarchy, SAMRAI::tbox::Pointer< SAMRAI::mesh::GriddingAlgorithm< NDIM > > gridding_alg, int u_data_idx, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::CoarsenSchedule< NDIM > > > &u_synch_scheds, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::RefineSchedule< NDIM > > > &u_ghost_fill_scheds, int integrator_step, double init_data_time, bool initial_time) override |
| void | addWorkloadEstimate (SAMRAI::tbox::Pointer< SAMRAI::hier::PatchHierarchy< NDIM > > hierarchy, const int workload_data_idx) override |
| void | beginDataRedistribution (SAMRAI::tbox::Pointer< SAMRAI::hier::PatchHierarchy< NDIM > > hierarchy, SAMRAI::tbox::Pointer< SAMRAI::mesh::GriddingAlgorithm< NDIM > > gridding_alg) override |
| void | endDataRedistribution (SAMRAI::tbox::Pointer< SAMRAI::hier::PatchHierarchy< NDIM > > hierarchy, SAMRAI::tbox::Pointer< SAMRAI::mesh::GriddingAlgorithm< NDIM > > gridding_alg) override |
| void | initializeLevelData (SAMRAI::tbox::Pointer< SAMRAI::hier::BasePatchHierarchy< NDIM > > hierarchy, int level_number, double init_data_time, bool can_be_refined, bool initial_time, SAMRAI::tbox::Pointer< SAMRAI::hier::BasePatchLevel< NDIM > > old_level, bool allocate_data) override |
| void | resetHierarchyConfiguration (SAMRAI::tbox::Pointer< SAMRAI::hier::BasePatchHierarchy< NDIM > > hierarchy, int coarsest_level, int finest_level) override |
| void | applyGradientDetector (SAMRAI::tbox::Pointer< SAMRAI::hier::BasePatchHierarchy< NDIM > > hierarchy, int level_number, double error_data_time, int tag_index, bool initial_time, bool uses_richardson_extrapolation_too) override |
| void | putToDatabase (SAMRAI::tbox::Pointer< SAMRAI::tbox::Database > db) override |
| virtual void | registerIBHierarchyIntegrator (IBHierarchyIntegrator *ib_solver) |
| virtual void | inactivateLagrangianStructure (int structure_number=0, int level_number=std::numeric_limits< int >::max()) |
| virtual void | activateLagrangianStructure (int structure_number=0, int level_number=std::numeric_limits< int >::max()) |
| virtual bool | getLagrangianStructureIsActivated (int structure_number=0, int level_number=std::numeric_limits< int >::max()) const |
| virtual double | getMaxPointDisplacement () const |
| void | setUseFixedLEOperators (bool use_fixed_coupling_ops=true) |
| virtual void | updateFixedLEOperators () |
| virtual void | setUseMultistepTimeStepping (unsigned int n_previous_steps=1) |
| virtual void | AB2Step (double current_time, double new_time) |
| virtual bool | hasFluidSources () const |
| virtual void | computeLagrangianFluidSource (double data_time) |
| virtual void | spreadFluidSource (int q_data_idx, IBTK::RobinPhysBdryPatchStrategy *q_phys_bdry_op, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::RefineSchedule< NDIM > > > &q_prolongation_scheds, double data_time) |
| virtual void | interpolatePressure (int p_data_idx, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::CoarsenSchedule< NDIM > > > &p_synch_scheds, const std::vector< SAMRAI::tbox::Pointer< SAMRAI::xfer::RefineSchedule< NDIM > > > &p_ghost_fill_scheds, double data_time) |
| virtual void | preprocessSolveFluidEquations (double current_time, double new_time, int cycle_num) |
| virtual void | postprocessSolveFluidEquations (double current_time, double new_time, int cycle_num) |
| virtual void | postprocessData () |
| virtual void | registerLoadBalancer (SAMRAI::tbox::Pointer< SAMRAI::mesh::LoadBalancer< NDIM > > load_balancer, int workload_data_idx) |
| virtual void | initializeLevelData (const tbox::Pointer< hier::BasePatchHierarchy< DIM > > hierarchy, const int level_number, const double init_data_time, const bool can_be_refined, const bool initial_time, const tbox::Pointer< hier::BasePatchLevel< DIM > > old_level=tbox::Pointer< hier::BasePatchLevel< DIM > >(NULL), const bool allocate_data=true)=0 |
| virtual void | resetHierarchyConfiguration (const tbox::Pointer< hier::BasePatchHierarchy< DIM > > hierarchy, const int coarsest_level, const int finest_level)=0 |
| virtual void | applyGradientDetector (const tbox::Pointer< hier::BasePatchHierarchy< DIM > > hierarchy, const int level_number, const double error_data_time, const int tag_index, const bool initial_time, const bool uses_richardson_extrapolation_too) |
| virtual double | getLevelDt (const tbox::Pointer< hier::BasePatchLevel< DIM > > level, const double dt_time, const bool initial_time) |
| virtual double | advanceLevel (const tbox::Pointer< hier::BasePatchLevel< DIM > > level, const tbox::Pointer< hier::BasePatchHierarchy< DIM > > hierarchy, const double current_time, const double new_time, const bool first_step, const bool last_step, const bool regrid_advance=false) |
| virtual void | resetTimeDependentData (const tbox::Pointer< hier::BasePatchLevel< DIM > > level, const double new_time, const bool can_be_refined) |
| virtual void | resetDataToPreadvanceState (const tbox::Pointer< hier::BasePatchLevel< DIM > > level) |
| virtual void | applyRichardsonExtrapolation (const tbox::Pointer< hier::PatchLevel< DIM > > level, const double error_data_time, const int tag_index, const double deltat, const int error_coarsen_ratio, const bool initial_time, const bool uses_gradient_detector_too) |
| virtual void | coarsenDataForRichardsonExtrapolation (const tbox::Pointer< hier::PatchHierarchy< DIM > > hierarchy, const int level_number, const tbox::Pointer< hier::PatchLevel< DIM > > coarser_level, const double coarsen_data_time, const bool before_advance) |
Private Member Functions | |
| IBInterpolantMethod ()=delete | |
| Default constructor. More... | |
| IBInterpolantMethod (const IBInterpolantMethod &from)=delete | |
| Copy constructor. More... | |
| IBInterpolantMethod & | operator= (const IBInterpolantMethod &that)=delete |
| Assignment operator. More... | |
| void | getFromInput (SAMRAI::tbox::Pointer< SAMRAI::tbox::Database > db, bool is_from_restart) |
| void | getFromRestart () |
This class does not provide direct support for fluid-structure interaction, but rather facilitates Eulerian-Lagrangian data management for LMesh.
| IBAMR::IBInterpolantMethod::IBInterpolantMethod | ( | std::string | object_name, |
| SAMRAI::tbox::Pointer< SAMRAI::tbox::Database > | input_db, | ||
| int | no_structures = 1, |
||
| bool | register_for_restart = true |
||
| ) |
| IBAMR::IBInterpolantMethod::~IBInterpolantMethod | ( | ) |
|
privatedelete |
|
privatedelete |
| from | The value to copy to this object. |
|
overridevirtual |
Register Eulerian variables with the parent IBHierarchyIntegrator with the VariableDatabase. They are used for interpolating the Eulerian quantities on the Lagrangian mesh.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Register ghost cell filling algrorithms for the Eulerian variables.
Reimplemented from IBAMR::IBStrategy.
|
virtual |
| void IBAMR::IBInterpolantMethod::registerLInitStrategy | ( | SAMRAI::tbox::Pointer< IBTK::LInitStrategy > | l_initializer | ) |
Supply a Lagrangian initialization object.
| void IBAMR::IBInterpolantMethod::freeLInitStrategy | ( | ) |
Free references to Lagrangian initialization objects.
| IBTK::LDataManager* IBAMR::IBInterpolantMethod::getLDataManager | ( | ) | const |
Return a pointer to the Lagrangian data manager object.
| int IBAMR::IBInterpolantMethod::getStructuresLevelNumber | ( | ) | const |
|
inline |
| void IBAMR::IBInterpolantMethod::registerLSiloDataWriter | ( | SAMRAI::tbox::Pointer< IBTK::LSiloDataWriter > | silo_writer | ) |
Register a Lagrangian Silo data writer so this class will write plot files that may be postprocessed with the VisIt visualization tool.
|
overridevirtual |
Return the number of ghost cells required by the Lagrangian-Eulerian interaction routines.
Implements IBAMR::IBStrategy.
|
overridevirtual |
Setup the tag buffer.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Method to prepare to advance data from current_time to new_time.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Method to clean up data following call(s) to integrateHierarchy().
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Interpolate the Eulerian velocity to the curvilinear mesh at the specified time within the current time interval.
Implements IBAMR::IBStrategy.
| void IBAMR::IBInterpolantMethod::interpolateQ | ( | double | data_time | ) |
Interpolate the Eulerian quantities to the curvilinear mesh at the specified time within the current time interval.
| void IBAMR::IBInterpolantMethod::interpolateQ | ( | ) |
Interpolate the Eulerian quantities to the curvilinear mesh at both current and new time.
|
overridevirtual |
Advance the positions of the Lagrangian structure using the forward Euler method.
Implements IBAMR::IBStrategy.
|
overridevirtual |
Advance the positions of the Lagrangian structure using the backward Euler method.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Advance the positions of the Lagrangian structure using the midpoint rule.
Implements IBAMR::IBStrategy.
|
overridevirtual |
Advance the positions of the Lagrangian structure using the trapezoidal rule.
Implements IBAMR::IBStrategy.
| void IBAMR::IBInterpolantMethod::updateMeshPosition | ( | double | current_time, |
| double | new_time, | ||
| const std::vector< Eigen::Vector3d > & | U, | ||
| const std::vector< Eigen::Vector3d > & | W | ||
| ) |
Update the position of the mesh at new time.
X^n+1 = R[theta]*X^n + U*dt
|
overridevirtual |
Compute the Lagrangian force at the specified time within the current time interval.
Implements IBAMR::IBStrategy.
|
overridevirtual |
Spread the Lagrangian force to the Cartesian grid at the specified time within the current time interval.
Implements IBAMR::IBStrategy.
| void IBAMR::IBInterpolantMethod::spreadQ | ( | double | data_time | ) |
Spread Q on the Eulerian grid.
|
inline |
Get the patch data index of Q.
| void IBAMR::IBInterpolantMethod::copyEulerianDataToIntegrator | ( | double | data_time | ) |
Copy the spreaded data back to the integrator.
|
overridevirtual |
Initialize Lagrangian data corresponding to the given AMR patch hierarchy at the start of a computation. If the computation is begun from a restart file, data may be read from the restart databases.
A patch data descriptor is provided for the Eulerian velocity in case initialization requires interpolating Eulerian data. Ghost cells for Eulerian data will be filled upon entry to this function.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Add the estimated computational work from the current object per cell into the specified workload_data_idx.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Begin redistributing Lagrangian data prior to regridding the patch hierarchy.
Reimplemented from IBAMR::IBStrategy.
|
overridevirtual |
Complete redistributing Lagrangian data following regridding the patch hierarchy.
Reimplemented from IBAMR::IBStrategy.
|
override |
Initialize data on a new level after it is inserted into an AMR patch hierarchy by the gridding algorithm.
|
override |
Reset cached hierarchy dependent data.
|
override |
Set integer tags to "one" in cells where refinement of the given level should occur according to user-supplied feature detection criteria.
|
overridevirtual |
Write out object state to the given database.
Implements SAMRAI::tbox::Serializable.
|
protected |
Get the structure position data.
|
protected |
Get the q data defined on Eulerian grid for interpolation.
|
protected |
Get the q data defined on Eulerian grid for spreading.
|
protected |
Copy the q_data_idx to suitable intergrator.
|
protected |
Get the Q data defined on Lagrangian mesh.
|
protected |
|
privatedelete |
| that | The value to assign to this object. |
|
private |
Read input values from a given database.
|
private |
Read object state from the restart file and initialize class data members.
|
virtualinherited |
Register the IBHierarchyIntegrator object that is using this strategy class.
Reimplemented in IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Inactivate a structure or part. Such a structure will be ignored by FSI calculations: i.e., it will have its velocity set to zero and no forces will be spread from the structure to the Eulerian grid.
| [in] | structure_number | Number of the structure/part. |
| [in] | level_number | Level on which the structure lives. For some inheriting classes (e.g., IBAMR::IBMethod) the structure number alone is not enough to establish uniqueness. The default value is interpreted as the finest level in the patch hierarchy. |
Reimplemented in IBAMR::IBFEMethod, and IBAMR::IBMethod.
|
virtualinherited |
Activate a previously inactivated structure or part to be used again in FSI calculations.
| [in] | structure_number | Number of the structure/part. |
| [in] | level_number | Level on which the structure lives. For some inheriting classes (e.g., IBAMR::IBMethod) the structure number alone is not enough to establish uniqueness. The default value is interpreted as the finest level in the patch hierarchy. |
Reimplemented in IBAMR::IBFEMethod, and IBAMR::IBMethod.
|
virtualinherited |
Determine whether or not the given structure or part is currently activated.
| [in] | structure_number | Number of the structure/part. |
| [in] | level_number | Level on which the structure lives. For some inheriting classes (e.g., IBAMR::IBMethod) the structure number alone is not enough to establish uniqueness. The default value is interpreted as the finest level in the patch hierarchy. |
Reimplemented in IBAMR::IBFEMethod, and IBAMR::IBMethod.
|
virtualinherited |
Get the ratio of the maximum point displacement of all the structures owned by the current class to the cell width of the grid level on which the structure is assigned. This value is useful for determining if the Eulerian patch hierarchy needs to be regridded.
Reimplemented in IBAMR::IBFEMethod, and IBAMR::IBStrategySet.
|
inherited |
Indicate whether "fixed" interpolation and spreading operators should be used during Lagrangian-Eulerian interaction.
|
virtualinherited |
Update the positions used for the "fixed" interpolation and spreading operators.
A default implementation is provided that emits an unrecoverable exception.
Reimplemented in IBAMR::IBMethod, IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Indicate that multistep time stepping will be used.
A default implementation is provided that emits an unrecoverable exception.
| [in] | n_previous_steps | Number of previous solution values that can be used by the multistep scheme. |
Reimplemented in IBAMR::IBFEMethod.
Advance the positions of the Lagrangian structure using the standard 2nd-order Adams-Bashforth rule.
A default implementation is provided that emits an unrecoverable exception.
Reimplemented in IBAMR::IBFEMethod.
|
virtualinherited |
Indicate whether there are any internal fluid sources/sinks.
A default implementation is provided that returns false.
Reimplemented in IBAMR::IBFEMethod, IBAMR::IBMethod, IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Compute the Lagrangian source/sink density at the specified time within the current time interval.
An empty default implementation is provided.
Reimplemented in IBAMR::IBFEMethod, IBAMR::IBMethod, IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Spread the Lagrangian source/sink density to the Cartesian grid at the specified time within the current time interval.
An empty default implementation is provided.
Reimplemented in IBAMR::IBFEMethod, IBAMR::IBMethod, IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Compute the pressures at the positions of any distributed internal fluid sources or sinks.
An empty default implementation is provided.
Reimplemented in IBAMR::IBMethod, IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Execute user-defined routines just before solving the fluid equations.
An empty default implementation is provided.
Reimplemented in IBAMR::IBLevelSetMethod, IBAMR::IBStrategySet, IBAMR::CIBMethod, and IBAMR::ConstraintIBMethod.
|
virtualinherited |
Execute user-defined routines just after solving the fluid equations.
An empty default implementation is provided.
Reimplemented in IBAMR::IBLevelSetMethod, IBAMR::IBStrategySet, and IBAMR::ConstraintIBMethod.
|
virtualinherited |
Execute user-defined post-processing operations.
An empty default implementation is provided.
Reimplemented in IBAMR::IBMethod, IBAMR::IBLevelSetMethod, and IBAMR::IBStrategySet.
|
virtualinherited |
Register a load balancer and work load patch data index with the IB strategy object.
An empty default implementation is provided.
Reimplemented in IBAMR::IBMethod, IBAMR::IBStrategySet, and IBAMR::IMPMethod.
|
pure virtualinherited |
Initialize data on a new level after it is inserted into an AMR patch hierarchy by the gridding algorithm. The level number indicates that of the new level.
Generally, when data is set, it is interpolated from coarser levels in the hierarchy. If the old level pointer in the argument list is non-null, then data is copied from the old level to the new level on regions of intersection between those levels before interpolation occurs. In this case, the level number must match that of the old level. The specific operations that occur when initializing level data are determined by the particular solution methods in use; i.e., in the subclass of this abstract base class.
The boolean argument initial_time indicates whether the level is being introduced for the first time (i.e., at initialization time), or after some regrid process during the calculation beyond the initial hierarchy construction. This information is provided since the initialization of the data may be different in each of those circumstances. The can_be_refined boolean argument indicates whether the level is the finest allowable level in the hierarchy.
|
pure virtualinherited |
After hierarchy levels have changed and data has been initialized on the new levels, this routine can be used to reset any information needed by the solution method that is particular to the hierarchy configuration. For example, the solution procedure may cache communication schedules to amortize the cost of data movement on the AMR patch hierarchy. This function will be called by the gridding algorithm after the initialization occurs so that the algorithm-specific subclass can reset such things. Also, if the solution method must make the solution consistent across multiple levels after the hierarchy is changed, this process may be invoked by this routine. Of course the details of these processes are determined by the particular solution methods in use.
The level number arguments indicate the coarsest and finest levels in the current hierarchy configuration that have changed. It should be assumed that all intermediate levels have changed as well.
|
virtualinherited |
Set integer tags to "one" in cells where refinement of the given level should occur according to some user-supplied gradient criteria. The double time argument is the regrid time. The integer "tag_index" argument is the patch descriptor index of the cell-centered integer tag array on each patch in the hierarchy. The boolean argument initial_time indicates whether the level is being subject to refinement at the initial simulation time. If it is false, then the error estimation process is being invoked at some later time after the AMR hierarchy was initially constructed. Typically, this information is passed to the user's patch tagging routines since the error estimator or gradient detector may be different in each case.
The boolean uses_richardson_extrapolation_too is true when Richardson extrapolation error estimation is used in addition to the gradient detector, and false otherwise. This argument helps the user to manage multiple regridding criteria.
This routine is only when gradient detector is being used. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed.
|
protectedinherited |
Return a pointer to the INSHierarchyIntegrator object being used with the IBHierarchyIntegrator class registered with this IBStrategy object.
|
protectedinherited |
Return a pointer to the HierarchyDataOpsReal object associated with velocity-like variables.
|
protectedinherited |
Return a pointer to the HierarchyDataOpsReal object associated with pressure-like variables.
|
protectedinherited |
Return a pointer to a HierarchyMathOps object.
|
protectedinherited |
Register a state variable with the integrator. When a refine operator is specified, the data for the variable are automatically maintained as the patch hierarchy evolves.
All state variables are registered with three contexts: current, new, and scratch. The current context of a state variable is maintained from time step to time step and, if the necessary coarsen and refine operators are specified, as the patch hierarchy evolves.
|
protectedinherited |
Register a variable with the integrator that may not be maintained from time step to time step.
By default, variables are registered with the scratch context, which is deallocated after each time step.
|
protectedinherited |
Register a ghost cell-filling refine algorithm.
|
protectedinherited |
Register a data-prolonging refine algorithm.
|
protectedinherited |
Register a coarsen algorithm.
|
protectedinherited |
Get ghost cell-filling refine algorithm.
|
protectedinherited |
Get data-prolonging refine algorithm.
|
protectedinherited |
Get coarsen algorithm.
|
protectedinherited |
Get ghost cell-filling refine schedules.
|
protectedinherited |
Get data-prolonging refine schedules.
|
protectedinherited |
Get coarsen schedules.
|
virtualinherited |
Determine time increment to advance data on level. The recompute_dt option specifies whether to compute the timestep using the current level data or to return the value stored by the time integrator. The default true setting means the timestep will be computed if no value is supplied.
This routine is only when Richardson extrapolation is being used. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed.
|
virtualinherited |
Advance data on all patches on specified patch level from current time (current_time) to new time (new_time). This routine is called only during time-dependent regridding procedures, such as Richardson extrapolation. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed. The boolean arguments are used to determine the state of the algorithm and the data when the advance routine is called. Note that this advance function is also used during normal time integration steps.
When this function is called, the level data required to begin the advance must be allocated and be defined appropriately. Typically, this is equivalent to what is needed to initialize a new level after regridding. Upon exiting this routine, both current and new data may exist on the level. This data is needed until level synchronization occurs, in general. Current and new data may be reset by calling the member function resetTimeDependentData().
This routine is called from two different points within the Richardson exptrapolation process: to advance a temporary level that is coarser than the hierarchy level on which error estimation is performed, and to advance the hierarchy level itself. In the first case, the values of the boolean flags are:
In the second case, the values of the boolean flags are:
|
virtualinherited |
Reset time-dependent data storage for the specified patch level.
This routine only applies when Richardson extrapolation is being used. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed.
|
virtualinherited |
Reset data on the patch level by destroying all patch data other than that which is needed to initialize the solution on that level. In other words, this is the data needed to begin a time integration step on the level.
This routine is only when Richardson extrapolation is being used. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed.
|
virtualinherited |
Set integer tags to "one" in cells where refinement of the given level should occur according to some user-supplied Richardson extrapolation criteria. The "error_data_time" argument is the regrid time. The "deltat" argument is the time increment to advance the solution on the level to be refined. Note that that level is finer than the level in the argument list, in general. The ratio between the argument level and the actual hierarchy level is given by the integer "coarsen ratio".
The integer "tag_index" argument is the patch descriptor index of the cell-centered integer tag array on each patch in the hierarchy.
The boolean argument initial_time indicates whether the level is being subject to refinement at the initial simulation time. If it is false, then the error estimation process is being invoked at some later time after the AMR hierarchy was initially constructed. Typically, this information is passed to the user's patch tagging routines since the application of the Richardson extrapolation process may be different in each case.
The boolean uses_gradient_detector_too is true when a gradient detector procedure is used in addition to Richardson extrapolation, and false otherwise. This argument helps the user to manage multiple regridding criteria.
This routine is only when Richardson extrapolation is being used. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed.
|
virtualinherited |
Coarsen solution data from level to coarse_level for Richardson extrapolation. Note that this routine will be called twice during the Richardson extrapolation error estimation process, once to set data on the coarser level and once to coarsen data from after advancing the fine level. The init_coarse_level boolean argument indicates whether data is set on the coarse level by coarsening the "old" time level solution or by coarsening the "new" solution on the fine level (i.e., after it has been advanced).
This routine is only when Richardson extrapolation is being used. It is virtual with an empty implementation here (rather than pure virtual) so that users are not required to provide an implementation when the function is not needed.
|
protected |
|
protected |
|
protected |
|
protected |
Vector of Lagrangian indices of all structures.
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protectedinherited |
The IBHierarchyIntegrator object that is using this strategy class.
|
protectedinherited |
Whether to use "fixed" Lagrangian-Eulerian coupling operators.
1.8.17