/usr/include/deal.II/lac/solver_relaxation.h is in libdeal.ii-dev 8.1.0-6ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 | // ---------------------------------------------------------------------
// $Id: solver_relaxation.h 31356 2013-10-20 21:34:20Z maier $
//
// Copyright (C) 2010 - 2013 by the deal.II authors
//
// This file is part of the deal.II library.
//
// The deal.II library is free software; you can use it, 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 2.1 of the License, or (at your option) any later version.
// The full text of the license can be found in the file LICENSE at
// the top level of the deal.II distribution.
//
// ---------------------------------------------------------------------
#ifndef __deal2__solver_relaxation_h
#define __deal2__solver_relaxation_h
#include <deal.II/base/config.h>
#include <deal.II/base/logstream.h>
#include <deal.II/lac/solver.h>
#include <deal.II/lac/solver_control.h>
#include <deal.II/base/subscriptor.h>
DEAL_II_NAMESPACE_OPEN
/**
* Implementation of an iterative solver based on relaxation
* methods. The stopping criterion is the norm of the residual.
*
* For the requirements on matrices and vectors in order to work with
* this class, see the documentation of the Solver base class.
*
* Like all other solver classes, this class has a local structure called
* @p AdditionalData which is used to pass additional parameters to the
* solver, like damping parameters or the number of temporary vectors. We
* use this additional structure instead of passing these values directly
* to the constructor because this makes the use of the @p SolverSelector and
* other classes much easier and guarantees that these will continue to
* work even if number or type of the additional parameters for a certain
* solver changes. AdditionalData of this class currently does not
* contain any data.
*
* @ingroup Solvers
* @author Guido Kanschat
* @date 2010
*/
template <class VECTOR = Vector<double> >
class SolverRelaxation : public Solver<VECTOR>
{
public:
/**
* Standardized data struct to
* pipe additional data to the
* solver. There is no data in
* here for relaxation methods.
*/
struct AdditionalData {};
/**
* Constructor.
*/
SolverRelaxation (SolverControl &cn,
const AdditionalData &data=AdditionalData());
/**
* Virtual destructor.
*/
virtual ~SolverRelaxation ();
/**
* Solve the system $Ax = b$
* using the relaxation method
* $x_{k+1} = R(x_k,b)$. The
* amtrix <i>A</i> itself is only
* used to compute the residual.
*/
template<class MATRIX, class RELAXATION>
void
solve (const MATRIX &A,
VECTOR &x,
const VECTOR &b,
const RELAXATION &R);
};
//----------------------------------------------------------------------//
template <class VECTOR>
SolverRelaxation<VECTOR>::SolverRelaxation(SolverControl &cn,
const AdditionalData &)
:
Solver<VECTOR> (cn)
{}
template <class VECTOR>
SolverRelaxation<VECTOR>::~SolverRelaxation()
{}
template <class VECTOR>
template <class MATRIX, class RELAXATION>
void
SolverRelaxation<VECTOR>::solve (
const MATRIX &A,
VECTOR &x,
const VECTOR &b,
const RELAXATION &R)
{
GrowingVectorMemory<VECTOR> mem;
SolverControl::State conv=SolverControl::iterate;
// Memory allocation
typename VectorMemory<VECTOR>::Pointer Vr(mem);
VECTOR &r = *Vr;
r.reinit(x);
typename VectorMemory<VECTOR>::Pointer Vd(mem);
VECTOR &d = *Vd;
d.reinit(x);
deallog.push("Relaxation");
try
{
// Main loop
for (int iter=0; conv==SolverControl::iterate; iter++)
{
// Compute residual
A.vmult(r,x);
r.sadd(-1.,1.,b);
// The required norm of the
// (preconditioned)
// residual is computed in
// criterion() and stored
// in res.
conv = this->control().check (iter, r.l2_norm());
if (conv != SolverControl::iterate)
break;
R.step(x,b);
}
}
catch (...)
{
deallog.pop();
throw;
}
deallog.pop();
// in case of failure: throw exception
if (this->control().last_check() != SolverControl::success)
AssertThrow(false, SolverControl::NoConvergence (this->control().last_step(),
this->control().last_value()));
// otherwise exit as normal
}
DEAL_II_NAMESPACE_CLOSE
#endif
|