/usr/include/deal.II/multigrid/mg_coarse.h is in libdeal.ii-dev 8.4.2-2+b1.
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 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 | // ---------------------------------------------------------------------
//
// Copyright (C) 2002 - 2016 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 dealii__mg_coarse_h
#define dealii__mg_coarse_h
#include <deal.II/lac/full_matrix.h>
#include <deal.II/lac/matrix_lib.h>
#include <deal.II/lac/householder.h>
#include <deal.II/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 MatrixType) 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<typename SolverType, class VectorType = Vector<double> >
class MGCoarseGridLACIteration : public MGCoarseGridBase<VectorType>
{
public:
/**
* Default constructor.
*/
MGCoarseGridLACIteration ();
/**
* Constructor. Store solver, matrix and preconditioning method for later
* use.
*/
template<typename MatrixType, typename PreconditionerType>
MGCoarseGridLACIteration (SolverType &,
const MatrixType &,
const PreconditionerType &);
/**
* Destructor freeing the pointers.
*/
~MGCoarseGridLACIteration ();
/**
* Initialize new data.
*/
template<typename MatrixType, typename PreconditionerType>
void initialize (SolverType &,
const MatrixType &,
const PreconditionerType &);
/**
* 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,
VectorType &dst,
const VectorType &src) const;
/**
* Sets the matrix. This gives the possibility to replace the matrix that
* was given to the constructor by a new matrix.
*/
template <typename MatrixType>
void set_matrix (const MatrixType &);
private:
/**
* Reference to the solver.
*/
SmartPointer<SolverType,MGCoarseGridLACIteration<SolverType,VectorType> > solver;
/**
* Reference to the matrix.
*/
PointerMatrixBase<VectorType> *matrix;
/**
* Reference to the preconditioner.
*/
PointerMatrixBase<VectorType> *precondition;
};
/**
* Coarse grid solver by QR factorization implemented in the class
* Householder.
*
* Upon initialization, the QR decomposition of the matrix is computed. then,
* the operator() uses Householder::least_squares() to compute the action of
* the inverse.
*
* @author Guido Kanschat, 2003, 2012
*/
template<typename number = double, class VectorType = Vector<number> >
class MGCoarseGridHouseholder : public MGCoarseGridBase<VectorType>
{
public:
/**
* Constructor, taking the coarse grid matrix.
*/
MGCoarseGridHouseholder (const FullMatrix<number> *A = 0);
/**
* Initialize for a new matrix.
*/
void initialize (const FullMatrix<number> &A);
void operator() (const unsigned int level,
VectorType &dst,
const VectorType &src) const;
private:
/**
* Matrix for QR-factorization.
*/
Householder<number> householder;
};
/**
* Coarse grid solver using singular value decomposition of LAPACK matrices.
*
* Upon initialization, the singular value decomposition of the matrix is
* computed. then, the operator() uses
*
* @author Guido Kanschat, 2003, 2012
*/
template<typename number = double, class VectorType = Vector<number> >
class MGCoarseGridSVD : public MGCoarseGridBase<VectorType>
{
public:
/**
* Constructor leaving an uninitialized object.
*/
MGCoarseGridSVD ();
/**
* Initialize for a new matrix. This resets the dimensions to the
*/
void initialize (const FullMatrix<number> &A, const double threshold = 0);
void operator() (const unsigned int level,
VectorType &dst,
const VectorType &src) const;
/**
* Write the singular values to @p deallog.
*/
void log () const;
private:
/**
* Matrix for singular value decomposition.
*/
LAPACKFullMatrix<number> matrix;
};
/*@}*/
#ifndef DOXYGEN
/* ------------------ Functions for MGCoarseGridLACIteration ------------ */
template<typename SolverType, class VectorType>
MGCoarseGridLACIteration<SolverType, VectorType>
::MGCoarseGridLACIteration()
:
solver(0, typeid(*this).name()),
matrix(0),
precondition(0)
{}
template<typename SolverType, class VectorType>
template<typename MatrixType, typename PreconditionerType>
MGCoarseGridLACIteration<SolverType, VectorType>
::MGCoarseGridLACIteration (SolverType &s,
const MatrixType &m,
const PreconditionerType &p)
:
solver(&s, typeid(*this).name())
{
matrix = new PointerMatrix<MatrixType, VectorType>(&m);
precondition = new PointerMatrix<PreconditionerType, VectorType>(&p);
}
template<typename SolverType, class VectorType>
MGCoarseGridLACIteration<SolverType, VectorType>
::~MGCoarseGridLACIteration()
{
clear();
}
template<typename SolverType, class VectorType>
template<typename MatrixType, typename PreconditionerType>
void
MGCoarseGridLACIteration<SolverType, VectorType>
::initialize (SolverType &s,
const MatrixType &m,
const PreconditionerType &p)
{
solver = &s;
if (matrix)
delete matrix;
matrix = new PointerMatrix<MatrixType, VectorType>(&m);
if (precondition)
delete precondition;
precondition = new PointerMatrix<PreconditionerType, VectorType>(&p);
}
template<typename SolverType, class VectorType>
void
MGCoarseGridLACIteration<SolverType, VectorType>
::clear()
{
solver = 0;
if (matrix)
delete matrix;
matrix = 0;
if (precondition)
delete precondition;
precondition = 0;
}
template<typename SolverType, class VectorType>
void
MGCoarseGridLACIteration<SolverType, VectorType>
::operator() (const unsigned int /* level */,
VectorType &dst,
const VectorType &src) const
{
Assert(solver!=0, ExcNotInitialized());
Assert(matrix!=0, ExcNotInitialized());
Assert(precondition!=0, ExcNotInitialized());
solver->solve(*matrix, dst, src, *precondition);
}
template<typename SolverType, class VectorType>
template<typename MatrixType>
void
MGCoarseGridLACIteration<SolverType, VectorType>
::set_matrix(const MatrixType &m)
{
if (matrix)
delete matrix;
matrix = new PointerMatrix<MatrixType, VectorType>(&m);
}
//---------------------------------------------------------------------------
template<typename number, class VectorType>
MGCoarseGridHouseholder<number, VectorType>::MGCoarseGridHouseholder
(const FullMatrix<number> *A)
{
if (A != 0) householder.initialize(*A);
}
template<typename number, class VectorType>
void
MGCoarseGridHouseholder<number, VectorType>::initialize(const FullMatrix<number> &A)
{
householder.initialize(A);
}
template<typename number, class VectorType>
void
MGCoarseGridHouseholder<number, VectorType>::operator() (const unsigned int /*level*/,
VectorType &dst,
const VectorType &src) const
{
householder.least_squares(dst, src);
}
//---------------------------------------------------------------------------
template<typename number, class VectorType>
inline
MGCoarseGridSVD<number, VectorType>::MGCoarseGridSVD()
{}
template<typename number, class VectorType>
void
MGCoarseGridSVD<number, VectorType>::initialize (const FullMatrix<number> &A,
double threshold)
{
matrix.reinit(A.n_rows(), A.n_cols());
matrix = A;
matrix.compute_inverse_svd(threshold);
}
template<typename number, class VectorType>
void
MGCoarseGridSVD<number, VectorType>::operator() (
const unsigned int /*level*/,
VectorType &dst,
const VectorType &src) const
{
matrix.vmult(dst, src);
}
template<typename number, class VectorType>
void
MGCoarseGridSVD<number, VectorType>::log() const
{
const unsigned int n = std::min(matrix.n_rows(), matrix.n_cols());
for (unsigned int i=0; i<n; ++i)
deallog << ' ' << matrix.singular_value(i);
deallog << std::endl;
}
#endif // DOXYGEN
DEAL_II_NAMESPACE_CLOSE
#endif
|