#include "pfasst/encap/implicit_sweeper.hpp"
#include <cassert>
#include "pfasst/globals.hpp"
#include "pfasst/logging.hpp"
Go to the source code of this file.
Namespaces | |
pfasst | |
pfasst::encap | |
Encapsulations (short encaps) are the central data type for all PFASST++ algorithms. | |
Typedefs | |
template<typename scalar > | |
using | pfasst::encap::lu_pair = pair< Matrix< scalar >, Matrix< scalar > > |
Functions | |
template<typename scalar > | |
static lu_pair< scalar > | pfasst::encap::lu_decomposition (const Matrix< scalar > &A) |
LU (without pivoting) decomposition. More... | |
template<typename time > | |
vector< time > | pfasst::encap::augment (time t0, time dt, vector< time > const &nodes) |
Augment nodes: nodes <- [t0] + dt * nodes. More... | |