From: Daniel Arndt Date: Thu, 6 Apr 2023 02:15:15 +0000 (-0400) Subject: Remove QuickMatrix X-Git-Tag: v9.5.0-rc1~372^2 X-Git-Url: https://gitweb.dealii.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=3c8598e863a62ba7be086e5767118375f8359601;p=dealii.git Remove QuickMatrix --- diff --git a/tests/lac/quickmatrix.h b/tests/lac/quickmatrix.h deleted file mode 100644 index cd834bfab9..0000000000 --- a/tests/lac/quickmatrix.h +++ /dev/null @@ -1,102 +0,0 @@ -// --------------------------------------------------------------------- -// -// Copyright (C) 2003 - 2021 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.md at -// the top level directory of deal.II. -// -// --------------------------------------------------------------------- - - -/** - * Hard-coded Laplacian matrix. - * Just a quick matrix to investigate processor performance. - * It implements a finite difference scheme on a grid of grid size 1 - * with #nx# times #ny# grid points. - * The diagonal is scaled to 1, resulting in an effective mesh width of 1/2. - */ - -template -class QuickMatrix -{ -public: - /** - * Constructor initializing the grid size. - */ - QuickMatrix(unsigned int nx, unsigned int ny); - - /** - * Matrix-vector-product. - */ - template - void - vmult(Vector &, const Vector &) const; - -protected: - const unsigned int nx; - const unsigned int ny; -}; - - -template -QuickMatrix::QuickMatrix(unsigned int nx, unsigned int ny) - : nx(nx) - , ny(ny) -{} - -template -template -void -QuickMatrix::vmult(Vector &d, const Vector &s) const -{ - const unsigned int step = nx - 1; - const unsigned int right = step - 1; - const unsigned int top = ny - 1; - - // Bottom row - - d(0) = s(0) - .25 * (s(1) + s(step)); - - for (unsigned int x = 1; x < right; ++x) - d(x) = s(x) - .25 * (s(x - 1) + s(x + 1) + s(x + step)); - - d(right) = s(right) - .25 * (s(right - 1) + s(right + step)); - - // Middle rows - - unsigned int start = 0; - for (unsigned int y = 1; y < top; ++y) - { - start += step; - d(start) = - s(start) - .25 * (s(start - step) + s(start + 1) + s(start + step)); - - for (unsigned int x = 1; x < right; ++x) - { - const unsigned int xy = start + x; - d(xy) = - s(xy) - .25 * (s(xy - step) + s(xy - 1) + s(xy + 1) + s(xy + step)); - } - d(start + right) = s(start + right) - - .25 * (s(start + right - 1) + s(start + right + step)); - } - - // Top row - - start += step; - d(start) = s(start) - .25 * (s(start - step) + s(start + 1)); - - for (unsigned int x = 1; x < right; ++x) - { - const unsigned int xy = start + x; - d(xy) = s(xy) - .25 * (s(xy - step) + s(xy - 1) + s(xy + 1)); - } - d(start + right) = - s(start + right) - .25 * (s(start + right - step) + s(start + right - 1)); -}