|
|
double | beta () const |
| |
|
element_type & | currentAcceleration () |
| |
|
element_type const & | currentAcceleration () const |
| |
|
element_ptrtype & | currentAccelerationPtr () |
| |
|
element_ptrtype const & | currentAccelerationPtr () const |
| |
|
element_type & | currentVelocity () |
| |
|
element_type const & | currentVelocity () const |
| |
|
element_ptrtype & | currentVelocityPtr () |
| |
|
element_ptrtype const & | currentVelocityPtr () const |
| |
|
double | gamma () const |
| | Coefficients \( \gamma \) and \( \beta \) of the time newmark discretization.
|
| |
|
void | initialize (element_type const &u0) |
| | Initialize all the entries of the unknown vector to be derived with the vector u0 (duplicated)
|
| |
|
void | loadCurrent () |
| |
|
| Newmark (Newmark const &b) |
| | copy operator
|
| |
| FEELPP_DEPRECATED | Newmark (po::variables_map const &vm, space_ptrtype const &space, std::string const &name, std::string const &prefix="") |
| | Constructor. More...
|
| |
| | Newmark (space_ptrtype const &space, std::string const &name) |
| | Constructor. More...
|
| |
|
| Newmark (space_ptrtype const &space, std::string const &name, std::string const &prefix="") |
| |
| double | next () const override |
| |
|
template<typename container_type > |
| double | next (typename space_type::template Element< value_type, container_type > const &u_curr, bool updateVelAcc=true) |
| | shift previousstored solutions with respect to the new one u_curr if updateVelAcc is true then the velocity and acceleration are updated too
|
| |
|
element_type const & | polyDeriv () const |
| | Returns the right hand side \( \bar{p} \) of the time derivative formula.
|
| |
|
double | polyDerivCoefficient () const |
| |
|
element_type const & | polyFirstDeriv () const |
| |
|
double | polyFirstDerivCoefficient () const |
| |
|
element_type const & | polySecondDeriv () const |
| |
|
double | polySecondDerivCoefficient () const |
| |
|
element_type const & | previousAcceleration (int k=0) const |
| |
|
element_type const & | previousUnknown (int k=0) const |
| | Return the last unknown.
|
| |
|
element_type const & | previousVelocity (int k=0) const |
| |
|
double | restart () |
| | restart the newmark scheme
|
| |
|
void | setBeta (double beta) |
| |
|
void | setGamma (double gamma) |
| |
| template<typename container_type > |
| void | shiftRight (typename space_type::template Element< value_type, container_type > const &u_curr) |
| | Update the vectors of the previous time steps by shifting on the right the old values. More...
|
| |
|
double | start () |
| | start the newmark scheme
|
| |
|
double | start (element_type const &u0) |
| |
|
template<typename container_type > |
| void | updateFromDisp (typename space_type::template Element< value_type, container_type > const &u_curr, int previousTimeStep=0) |
| | from the displacement u_curr update the velocity and acceleration
|
| |
|
bool | doRestartAtLastSave () const |
| | return value of do restart at last save
|
| |
|
std::string | fileFormat () const |
| | return file format saved and loaded : binary or hdf5
|
| |
|
bool | isFinished () const |
| | return true if Bdf is finished, false otherwise
|
| |
|
bool | isRestart () const |
| | return the value of the bool restart
|
| |
|
bool | isReverse () const |
| | return the reverse time loop state.
|
| |
|
bool | isReverseLoad () const |
| | return the reverse time loop state.
|
| |
|
bool | isRunning () const |
| |
|
bool | isSteady () const |
| |
|
bool | isStopped () const |
| |
|
int | iteration () const |
| | return the current iteration
|
| |
|
const int | iterationNumber () const |
| | return the number of iteration
|
| |
| virtual double | next () const |
| | advance in time More...
|
| |
|
int | nRestart () const |
| | return the number of restarts
|
| |
|
TSBase & | operator= (TSBase const &b) |
| |
|
fs::path | path () |
| | return the relative path where the bdf data is stored
|
| |
| std::string const & | prefix () const |
| |
|
virtual void | print () const |
| |
| virtual std::map< int, double > | priorTimes () const |
| |
|
bool | rankProcInNameOfFiles () const |
| |
|
double | realTimePerIteration () const |
| | return the real time in seconds spent in the iteration
|
| |
|
void | reloadMetaData () |
| | reload metadata to get all time step already done
|
| |
|
double | restart () |
| | restart the bdf
|
| |
|
fs::path | restartPath () |
| |
|
int | restartStepBeforeLastSave () const |
| | return the step index before the last used to restart
|
| |
|
int | saveFreq () const |
| |
|
bool | saveInFile () const |
| |
|
template<class Archive > |
| void | serialize (Archive &ar, const unsigned int version) |
| | save/load Bdf metadata
|
| |
|
void | setfileFormat (std::string s) |
| |
|
void | setPathSave (std::string s) |
| |
|
void | setRankProcInNameOfFiles (bool b) |
| |
|
void | setRestart (bool doRestart) |
| |
|
void | setRestartAtLastSave (bool b) |
| |
|
void | setRestartPath (std::string const &s) |
| |
|
void | setReverse (bool reverse=false) |
| | Reverse time (iteration always start at 0!)
|
| |
|
void | setReverseLoad (bool reverseLoad=false) |
| | Load saved unknown beginning from last iteration. In bdf, solutions are saved from Ti (iter 0) ->Tf (iter N) in hdf5 files indexed by the iteration. If we reverse bdf, it runs from Tf (iter 0) -> Ti (iter N). To read hdf5 solution from files, we have to load the file N at Ti. Therefore reversing iteration index to load the correct file. Note: it is not required if the solution has to be saved.
|
| |
|
void | setSaveFreq (int v) |
| |
|
void | setSaveInFile (bool b) |
| |
|
void | setSteady (bool steady=true) |
| |
|
void | setTimeFinal (double T) |
| |
|
void | setTimeInitial (double ti) |
| |
|
void | setTimeStep (double dt) |
| |
|
virtual void | shiftRight () |
| |
|
double | start () |
| | start the bdf
|
| |
|
TSState | state () const |
| | return the state of the BDF
|
| |
|
TSStragegy | strategy () const |
| |
|
double | time () const |
| | return the current time
|
| |
|
double | timeFinal () const |
| | return the final time
|
| |
|
double | timeInitial () const |
| | return the initial time
|
| |
|
double | timeStep () const |
| | return the final step
|
| |
|
time_values_map_type | timeValues () const |
| | return vector of time
|
| |
|
| TSBase (std::string name, std::string const &prefix, WorldComm const &worldComm, po::variables_map const &vm, double ti, double tf, double dt, bool steady, bool reverse, bool restart, std::string const &restart_path, bool restart_at_last_save, bool save, int freq, bool rank_proc_in_files_name, std::string const &format) |
| |
|
| TSBase (std::string name, std::string const &prefix, WorldComm const &worldComm, po::variables_map const &vm=Environment::vm()) |
| |
|
| TSBase (std::string name, WorldComm const &worldComm) |
| |
|
| TSBase (TSBase const &b) |
| |
|
virtual void | update () |
| |
|
WorldComm const & | worldComm () const |
| |
template<typename SpaceType>
class Feel::Newmark< SpaceType >
Newmark discretization.
A differential equation of the form
\( M \ddot{\boldsymbol{\eta}}^{n+1} = A \boldsymbol{\eta}^{n+1} + f \)
is discretized in time as
\begin{eqnarray} \ddot{\boldsymbol{\eta}}^{n+1} &=& \frac{1}{\beta \Delta t^2} \left( \boldsymbol{\eta}^{n+1}-\boldsymbol{\eta}^{n} \right) - \frac{1}{\beta \Delta t} \dot{\boldsymbol{\eta}}^{n} - \left( \frac{1}{2 \beta} -1 \right) \ddot{\boldsymbol{\eta}}^{n} \\ \dot{\boldsymbol{\eta}}^{n+1} &=& \frac{\gamma}{\beta \Delta t} \left( \boldsymbol{\eta}^{n+1}-\boldsymbol{\eta}^{n} \right) - \left( \frac{\gamma}{\beta} -1 \right) \dot{\boldsymbol{\eta}}^{n} - \Delta t \left( \frac{\gamma}{2\beta}-1 \right) \ddot{\boldsymbol{\eta}}^{n} \end{eqnarray}