// Copyright (C) 2012-2016 Garth N. Wells // // This file is part of DOLFIN. // // DOLFIN is free software: you can redistribute it and/or modify // it under the terms of the GNU Lesser General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // DOLFIN 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 Lesser General Public License for more details. // // You should have received a copy of the GNU Lesser General Public License // along with DOLFIN. If not, see . // // This demo program illustrates how to solve Poisson's equation // // - div grad u(x, y) = f(x, y) // // on the unit square with pure Neumann boundary conditions: // // du/dn(x, y) = -sin(5*x) // // and source f given by // // f(x, y) = 10*exp(-((x - 0.5)^2 + (y - 0.5)^2) / 0.02) // // Since only Neumann conditions are applied, u is only determined up to // a constant c by the above equations. An addition constraint is thus // required, for instance // // \int u = 0 // // This is accomplished in this demo by using a Krylov iterative solver // that removes the component in the null space from the solution vector. #include #include "Poisson.h" using namespace dolfin; // Source term (right-hand side) class Source : public Expression { void eval(Array& values, const Array& x) const { double dx = x[0] - 0.5; double dy = x[1] - 0.5; values[0] = 10*exp(-(dx*dx + dy*dy) / 0.02); } }; // Boundary flux (Neumann boundary condition) class Flux : public Expression { void eval(Array& values, const Array& x) const { values[0] = -sin(5*x[0]); } }; int main() { #ifdef HAS_PETSC // Create mesh and function space auto mesh = std::make_shared(128, 128); auto V = std::make_shared(mesh); // Define variational problem Poisson::BilinearForm a(V, V); Poisson::LinearForm L(V); auto f = std::make_shared(); auto g = std::make_shared(); L.f = f; L.g = g; // Assemble system auto A = std::make_shared(); PETScVector b; assemble(*A, a); assemble(b, L); // Create constant vector that spans null space (normalised) auto null_space_vector = b.copy(); *null_space_vector = sqrt(1.0/null_space_vector->size()); // Create null space basis object and attach to PETSc matrix VectorSpaceBasis null_space({null_space_vector}); A->set_nullspace(null_space); // Orthogonalize b with respect to the null space (this gurantees // that a solution exists) null_space.orthogonalize(b); // Set PETSc solve type (conjugate gradient) and preconditioner // (algebraic multigrid) PETScOptions::set("ksp_type", "cg"); PETScOptions::set("pc_type", "gamg"); // Since we have a singular problem, use SVD solver on the multigrid // 'coarse grid' PETScOptions::set("mg_coarse_ksp_type", "preonly"); PETScOptions::set("mg_coarse_pc_type", "svd"); // Set the solver tolerance PETScOptions::set("ksp_rtol", 1.0e-8); // Print PETSc solver configuration PETScOptions::set("ksp_view"); PETScOptions::set("ksp_monitor"); // Create PETSc Krylov solver and attach operator PETScKrylovSolver solver; solver.set_operator(A); // Set PETSc options on the solver solver.set_from_options(); // Create solution Function Function u(V); // Solve solver.solve(*u.vector(), b); // Check residual Vector residual(*u.vector()); A->mult(*u.vector(), residual); residual.axpy(-1.0, b); info("Norm of residual: %lf", residual.norm("l2")); // Write out solution to XDMF file. XDMFFile("u.xdmf").write(u); #else cout << "This demo requires DOLFIN to be confugured with PETSc." << endl; #endif return 0; }