#include <dune/istl/paamg/galerkin.hh>
Public Member Functions | |
template<class M , class G , class V , class Set > | |
M * | build (const M &fine, G &fineGraph, V &visitedMap, const SequentialInformation &pinfo, const AggregatesMap< typename G::VertexDescriptor > &aggregates, const typename M::size_type &size, const Set ©) |
Calculates the coarse matrix via a Galerkin product. | |
template<class M , class V , class I , class O > | |
void | calculate (const M &fine, const AggregatesMap< V > &aggregates, M &coarse, const I &pinfo, const O ©) |
Calculate the galerkin product. | |
template<class M , class V , class P , class O > | |
void | calculate (const M &fine, const AggregatesMap< V > &aggregates, M &coarse, const P &pinfo, const O ©) |
void Dune::Amg::BaseGalerkinProduct::calculate | ( | const M & | fine, | |
const AggregatesMap< V > & | aggregates, | |||
M & | coarse, | |||
const I & | pinfo, | |||
const O & | copy | |||
) | [inline, inherited] |
Calculate the galerkin product.
fine | The fine matrix. | |
aggregates | The aggregate mapping. | |
coarse | The coarse Matrix. | |
pinfo | Parallel information about the fine level. | |
copy | The attribute set identifying the copy nodes of the graph. |
Referenced by Dune::Amg::MatrixHierarchy< M, PI, A >::build(), and Dune::Amg::MatrixHierarchy< M, PI, A >::recalculateGalerkin().