|
|
void | addStep (double k) |
| |
|
template<typename FT > |
| void | addStep (double k1, FT const &f_u, FT const &f_acc) |
| |
|
template<typename FT > |
| void | addStep (FT const &f_u, FT const &f_acc, double k1) |
| |
|
template<typename BCType > |
| void | averaging (BCType &bc, double k1) |
| |
|
template<typename FT > |
| | CNAB2 (FT const &f) |
| |
|
template<typename FT > |
| double | computeError (FT &fd) |
| |
| std::pair< bool, double > | computeStep (double step, double err) |
| | test that during the current time step, the error err has decreazed sufficiently. More...
|
| |
|
void | eraseStep (double k) |
| |
|
field_t const & | extrapolateVelocity () |
| |
|
field_t const & | field () const |
| |
| bool | isFinished () const |
| |
| double | l2Error () const |
| |
|
template<typename FT , typename BCType > |
| bool | next (FT &d, BCType &bc, bool is_converged=true) |
| |
|
field_t const & | rateOfChange () const |
| |
|
template<typename FT , typename BCType > |
| void | start (FT &d, BCType &bc) |
| |
|
size_t | index () const |
| |
|
double & | k () |
| |
|
double | k () const |
| |
|
double & | kprev (int n) |
| |
|
double | kprev (int n) const |
| |
|
void | print () |
| |
|
void | push_back (double k1, double t1) |
| |
|
void | push_back (double k1, double t1, double err) |
| |
|
void | save (std::string const &fname="times.tsv") |
| | save times and time steps in fname
|
| |
|
double & | t () |
| |
|
double | t () const |
| |
|
double & | tprev (int n) |
| |
|
double | tprev (int n) const |
| |