newmark.hh
Abstract strategy class for the class Timestepping.
Definition: strategy.hh:32
Timestep strategy for the Newmark algorithm to solve second order problems in time with no first orde...
Definition: newmark.hh:40
double beta(const double a, const double b)
Newmark(concepts::SolverFabric< Real > &fabric, concepts::Operator< Real > &D2, concepts::Operator< Real > &D0, timestepping::TimeVector &trhs, const concepts::Vector< Real > &Y0, const concepts::Vector< Real > &Z0, Real dt, Real beta=0.25, Real gamma=0.5)
Constructor.
virtual void next()
The overloaded member function next() has to calculate the new right hand side and to release the sol...
std::unique_ptr< concepts::Operator< Real > > lhs_
Left hand side of the scheme.
Definition: newmark.hh:73
virtual std::ostream & info(std::ostream &os) const
Returns information in an output stream.