/usr/include/deal.II/multigrid/mg_coarse.h is in libdeal.ii-dev 6.3.1-1.1.
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 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 | //---------------------------------------------------------------------------
// $Id: mg_coarse.h 20588 2010-02-13 04:35:56Z bangerth $
// Version: $Name$
//
// Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2009, 2010 by the deal.II authors
//
// This file is subject to QPL and may not be distributed
// without copyright and license information. Please refer
// to the file deal.II/doc/license.html for the text and
// further information on this license.
//
//---------------------------------------------------------------------------
#ifndef __deal2__mg_coarse_h
#define __deal2__mg_coarse_h
#include <lac/full_matrix.h>
#include <lac/matrix_lib.h>
#include <lac/householder.h>
#include <multigrid/mg_base.h>
DEAL_II_NAMESPACE_OPEN
/*!@addtogroup mg */
/*@{*/
/**
* Coarse grid solver using LAC iterative methods.
* This is a little wrapper, transforming a triplet of iterative
* solver, matrix and preconditioner into a coarse grid solver.
*
* The type of the matrix (i.e. the template parameter @p MATRIX)
* should be derived from @p Subscriptor to allow for the use of a
* smart pointer to it.
*
* @author Guido Kanschat, 1999, Ralf Hartmann, 2002.
*/
template<class SOLVER, class VECTOR = Vector<double> >
class MGCoarseGridLACIteration : public MGCoarseGridBase<VECTOR>
{
public:
/**
* Default constructor.
*/
MGCoarseGridLACIteration ();
/**
* Constructor.
* Store solver, matrix and
* preconditioning method for later
* use.
*/
template<class MATRIX, class PRECOND>
MGCoarseGridLACIteration (SOLVER &,
const MATRIX &,
const PRECOND &);
/**
* Destructor freeing the pointers.
*/
~MGCoarseGridLACIteration ();
/**
* Initialize new data.
*/
template<class MATRIX, class PRECOND>
void initialize (SOLVER &,
const MATRIX &,
const PRECOND &);
/**
* Clear all pointers.
*/
void clear ();
/**
* Implementation of the abstract
* function.
* Calls the solver method with
* matrix, vectors and
* preconditioner.
*/
void operator() (const unsigned int level,
VECTOR &dst,
const VECTOR &src) const;
/**
* Sets the matrix. This gives
* the possibility to replace the
* matrix that was given to the
* constructor by a new matrix.
*/
template <class MATRIX>
void set_matrix (const MATRIX &);
private:
/**
* Reference to the solver.
*/
SmartPointer<SOLVER,MGCoarseGridLACIteration<SOLVER,VECTOR> > solver;
/**
* Reference to the matrix.
*/
PointerMatrixBase<VECTOR>* matrix;
/**
* Reference to the preconditioner.
*/
PointerMatrixBase<VECTOR>* precondition;
};
//TODO: Improve QR-factorization to make this more efficient.
/**
* Coarse grid solver by QR factorization
*
* This is a direct solver for possibly indefinite coarse grid
* problems, using the @p least_squares function of the class
* FullMatrix.
*
* Since the currently implemented Householder algorithm transforms
* the right hand side immediately, the transformation has to be
* computed for each coarse grid solution. Therefore, this coarse grid
* solver may be inefficient for larger coarse grid systems.
*
* @author Guido Kanschat, 2003
*/
template<typename number = double, class VECTOR = Vector<number> >
class MGCoarseGridHouseholder : public MGCoarseGridBase<VECTOR>
{
public:
/**
* Constructor, taking the coarse
* grid matrix.
*/
MGCoarseGridHouseholder (const FullMatrix<number>* A = 0);
/**
* Initialize for a new matrix.
*/
void initialize (const FullMatrix<number>& A);
/**
* Release matrix pointer.
*/
void clear ();
/**
* Solution operator, defined in
* the base class.
*/
void operator() (const unsigned int level,
VECTOR &dst,
const VECTOR &src) const;
private:
/**
* Matrix for QR-factorization.
*/
Householder<number> householder;
};
/*@}*/
#ifndef DOXYGEN
/* ------------------ Functions for MGCoarseGridLACIteration ------------ */
template<class SOLVER, class VECTOR>
MGCoarseGridLACIteration<SOLVER, VECTOR>
::MGCoarseGridLACIteration()
:
solver(0, typeid(*this).name()),
matrix(0),
precondition(0)
{}
template<class SOLVER, class VECTOR>
template<class MATRIX, class PRECOND>
MGCoarseGridLACIteration<SOLVER, VECTOR>
::MGCoarseGridLACIteration(SOLVER& s,
const MATRIX &m,
const PRECOND &p)
:
solver(&s, typeid(*this).name())
{
matrix = new PointerMatrix<MATRIX, VECTOR>(&m);
precondition = new PointerMatrix<PRECOND, VECTOR>(&p);
}
template<class SOLVER, class VECTOR>
MGCoarseGridLACIteration<SOLVER, VECTOR>
::~MGCoarseGridLACIteration()
{
clear();
}
template<class SOLVER, class VECTOR>
template<class MATRIX, class PRECOND>
void
MGCoarseGridLACIteration<SOLVER, VECTOR>
::initialize(SOLVER& s,
const MATRIX &m,
const PRECOND &p)
{
solver = &s;
if (matrix)
delete matrix;
matrix = new PointerMatrix<MATRIX, VECTOR>(&m);
if (precondition)
delete precondition;
precondition = new PointerMatrix<PRECOND, VECTOR>(&p);
}
template<class SOLVER, class VECTOR>
void
MGCoarseGridLACIteration<SOLVER, VECTOR>
::clear()
{
solver = 0;
if (matrix)
delete matrix;
matrix = 0;
if (precondition)
delete precondition;
precondition = 0;
}
template<class SOLVER, class VECTOR>
void
MGCoarseGridLACIteration<SOLVER, VECTOR>
::operator() (const unsigned int /* level */,
VECTOR &dst,
const VECTOR &src) const
{
Assert(solver!=0, ExcNotInitialized());
Assert(matrix!=0, ExcNotInitialized());
Assert(precondition!=0, ExcNotInitialized());
solver->solve(*matrix, dst, src, *precondition);
}
template<class SOLVER, class VECTOR>
template<class MATRIX>
void
MGCoarseGridLACIteration<SOLVER, VECTOR>
::set_matrix(const MATRIX &m)
{
if (matrix)
delete matrix;
matrix = new PointerMatrix<MATRIX, VECTOR>(&m);
}
//---------------------------------------------------------------------------
template<typename number, class VECTOR>
MGCoarseGridHouseholder<number, VECTOR>::MGCoarseGridHouseholder(
const FullMatrix<number>* A)
{
if (A != 0) householder.initialize(*A);
}
template<typename number, class VECTOR>
void
MGCoarseGridHouseholder<number, VECTOR>::initialize(
const FullMatrix<number>& A)
{
householder.initialize(A);
}
template<typename number, class VECTOR>
void
MGCoarseGridHouseholder<number, VECTOR>::clear()
{}
template<typename number, class VECTOR>
void
MGCoarseGridHouseholder<number, VECTOR>::operator() (
const unsigned int,
VECTOR &dst,
const VECTOR &src) const
{
householder.least_squares(dst, src);
}
#endif // DOXYGEN
DEAL_II_NAMESPACE_CLOSE
#endif
|