// ************************************************************************** // // PARALUTION www.paralution.com // // Copyright (C) 2015 PARALUTION Labs UG (haftungsbeschränkt) & Co. KG // Am Hasensprung 6, 76571 Gaggenau // Handelsregister: Amtsgericht Mannheim, HRA 706051 // Vertreten durch: // PARALUTION Labs Verwaltungs UG (haftungsbeschränkt) // Am Hasensprung 6, 76571 Gaggenau // Handelsregister: Amtsgericht Mannheim, HRB 721277 // Geschäftsführer: Dimitar Lukarski, Nico Trost // // This program is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see <http://www.gnu.org/licenses/>. // // ************************************************************************** // PARALUTION version 1.1.0 #include <iostream> #include <cstdlib> #include <paralution.hpp> using namespace paralution; int main(int argc, char* argv[]) { init_paralution(); info_paralution(); LocalVector<double> x; LocalVector<double> rhs; LocalStencil<double> stencil(Laplace2D); stencil.SetGrid(100); // 100x100 x.Allocate("x", stencil.get_nrow()); rhs.Allocate("rhs", stencil.get_nrow()); // Linear Solver CG<LocalStencil<double>, LocalVector<double>, double > ls; rhs.Ones(); x.Zeros(); ls.SetOperator(stencil); ls.Build(); stencil.info(); double tick, tack; tick = paralution_time(); ls.Solve(rhs, &x); tack = paralution_time(); std::cout << "Solver execution:" << (tack-tick)/1000000 << " sec" << std::endl; ls.Clear(); stop_paralution(); return 0; }