// 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: /*#include"xreal.h" namespace std { HPA::xreal abs(const HPA::xreal& t) { return t>=0?t:-t; } }; */ #include "anisotropic.hh" #include #include #include #include #include #include #include #include #include #include #define NUM_THREADS 3 typedef double XREAL; /* typedef HPA::xreal XREAL; namespace Dune { template<> struct DoubleConverter { static double toDouble(const HPA::xreal& t) { return t._2double(); } }; } */ template void randomize(const M& mat, V& b) { V x=b; srand((unsigned)std::clock()); typedef typename V::iterator iterator; for(iterator i=x.begin(); i != x.end(); ++i) *i=(rand() / (RAND_MAX + 1.0)); mat.mv(static_cast(x), b); } typedef Dune::ParallelIndexSet ParallelIndexSet; typedef Dune::FieldMatrix MatrixBlock; typedef Dune::BCRSMatrix BCRSMat; typedef Dune::FieldVector VectorBlock; typedef Dune::BlockVector Vector; typedef Dune::MatrixAdapter Operator; typedef Dune::Communication Comm; typedef Dune::SeqSSOR Smoother; typedef Dune::Amg::SmootherTraits::Arguments SmootherArgs; struct thread_arg { MYAMG *amg; Vector *b; Vector *x; Operator *fop; }; void *solve(void* arg) { thread_arg *amgarg=(thread_arg*) arg; Dune::GeneralizedPCGSolver amgCG(*amgarg->fop,*amgarg->amg,1e-6,80,2); //Dune::LoopSolver amgCG(fop, amg, 1e-4, 10000, 2); Dune::Timer watch; Dune::InverseOperatorResult r; amgCG.apply(*amgarg->x,*amgarg->b,r); double solvetime = watch.elapsed(); std::cout<<"AMG solving took "<x=0; (*amgarg->amg).pre(*amgarg->x,*amgarg->b); (*amgarg->amg).apply(*amgarg->x,*amgarg->b); (*amgarg->amg).post(*amgarg->x); return 0; } template void testAMG(int N, int coarsenTarget, int ml) { std::cout<<"N="< > Criterion; //typedef Dune::SeqSOR Smoother; //typedef Dune::SeqJac Smoother; //typedef Dune::SeqOverlappingSchwarz Smoother; //typedef Dune::SeqOverlappingSchwarz Smoother; //typedef Dune::SeqOverlappingSchwarz Smoother; SmootherArgs smootherArgs; smootherArgs.iterations = 1; //smootherArgs.overlap=SmootherArgs::vertex; //smootherArgs.overlap=SmootherArgs::none; //smootherArgs.overlap=SmootherArgs::aggregate; smootherArgs.relaxationFactor = 1; Criterion criterion(15,coarsenTarget); criterion.setDefaultValuesIsotropic(2); criterion.setAlpha(.67); criterion.setBeta(1.0e-4); criterion.setMaxLevel(ml); criterion.setSkipIsolated(false); Smoother smoother(mat,1,1); AMG amg(fop, criterion); double buildtime = watch.elapsed(); std::cout<<"Building hierarchy took "< amgs(NUM_THREADS, amg); std::vector args(NUM_THREADS); std::vector threads(NUM_THREADS); for(int i=0; i < NUM_THREADS; ++i) { args[i].amg=&amgs[i]; args[i].b=&bs[i]; args[i].x=&xs[i]; args[i].fop=&fop; pthread_create(&threads[i], NULL, solve, (void*) &args[i]); } void* retval; for(int i=0; i < NUM_THREADS; ++i) pthread_join(threads[i], &retval); amgs.clear(); args.clear(); amg.pre(x, b); amgs.resize(NUM_THREADS, amg); for(int i=0; i < NUM_THREADS; ++i) { args[i].amg=&amgs[i]; args[i].b=&bs[i]; args[i].x=&xs[i]; args[i].fop=&fop; pthread_create(&threads[i], NULL, solve2, (void*) &args[i]); } for(int i=0; i < NUM_THREADS; ++i) pthread_join(threads[i], &retval); } int main(int argc, char** argv) try { int N=100; int coarsenTarget=1200; int ml=10; if(argc>1) N = atoi(argv[1]); if(argc>2) coarsenTarget = atoi(argv[2]); if(argc>3) ml = atoi(argv[3]); testAMG<1,MYAMG>(N, coarsenTarget, ml); //testAMG<2>(N, coarsenTarget, ml); return 0; } catch (std::exception &e) { std::cout << "ERROR: " << e.what() << std::endl; return 1; } catch (...) { std::cerr << "Dune reported an unknown error." << std::endl; exit(1); }