// SPDX-FileCopyrightText: Copyright © DUNE Project contributors, see file LICENSE.md in module root // SPDX-License-Identifier: LicenseRef-GPL-2.0-only-with-DUNE-exception // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- // vi: set et ts=4 sw=2 sts=2: #ifndef DUNE_ISTL_FASTAMGSMOOTHER_HH #define DUNE_ISTL_FASTAMGSMOOTHER_HH #include #include namespace Dune { namespace Amg { template struct GaussSeidelPresmoothDefect { template static void apply(const M& A, X& x, Y& d, const Y& b) { typedef typename M::ConstRowIterator RowIterator; typedef typename M::ConstColIterator ColIterator; typename Y::iterator dIter=d.begin(); typename Y::const_iterator bIter=b.begin(); typename X::iterator xIter=x.begin(); for(RowIterator row=A.begin(), end=A.end(); row != end; ++row, ++dIter, ++xIter, ++bIter) { ColIterator col=(*row).begin(); *dIter = *bIter; for (; col.index()>::value) *dIter -= (*col)*x[col.index()]; else (*col).mmv(x[col.index()],*dIter); // rhs -= sum_{j>::value) *xIter = (*dIter)/(*diag); else diag->solve(*xIter,*dIter); *dIter=0; //as r=v // Update residual for the symmetric case for(col=(*row).begin(); col.index()>::value) d[col.index()] -= (*col)*(*xIter); else col->mmv(*xIter, d[col.index()]); //d_j-=A_ij x_i } } } }; template struct GaussSeidelPostsmoothDefect { template static void apply(const M& A, X& x, Y& d, const Y& b) { typedef typename M::ConstRowIterator RowIterator; typedef typename M::ConstColIterator ColIterator; typedef typename Y::block_type YBlock; typename Y::iterator dIter=d.beforeEnd(); typename X::iterator xIter=x.beforeEnd(); typename Y::const_iterator bIter=b.beforeEnd(); for(RowIterator row=A.beforeEnd(), end=A.beforeBegin(); row != end; --row, --dIter, --xIter, --bIter) { ColIterator endCol=(*row).beforeBegin(); ColIterator col=(*row).beforeEnd(); *dIter = *bIter; for (; col.index()>row.index(); --col) { if constexpr (Dune::IsNumber>::value) *dIter -= (*col)*x[col.index()]; else (*col).mmv(x[col.index()],*dIter); // rhs -= sum_{j>::value) v -= (*col)*x[col.index()]; else (*col).mmv(x[col.index()],v); // v -= sum_{j>::value) *xIter = v/(*diag); else diag->solve(*xIter,v); *dIter-=v; // Update residual for the symmetric case // Skip residual computation as it is not needed. //for(col=(*row).begin();col.index()