mirror of
https://github.com/paboyle/Grid.git
synced 2025-04-04 11:15:55 +01:00
6121397587
Added storage of final true residual in mixed-prec CG and enhanced log output Fixed const correctness of multi-shift constructor Added a mixed precision variant of the multi-shift algorithm that uses a single precision operator and applies periodic reliable update to the residual Added tests/solver/Test_dwf_multishift_mixedprec to test the above Fixed local coherence lanczos using the (large!) max approx to the chebyshev eval as the scale from which to judge the quality of convergence, resulting a test that always passes Added a method to local coherence lanczos class that returns the fine eval/evec pair Added iterative log output to power method Added optional disabling of the plaquette check in Nerscio to support loading old G-parity configs which have a factor of 2 error in the plaquette G-parity Dirac op no longer allows GPBC in the time direction; instead we toggle between periodic and antiperiodic Replaced thread_for G-parity 5D force insertion implementation with accelerator_for version capable of running on GPUs Generalized tests/lanczos/Test_dwf_lanczos to support regular DWF as well as Gparity, with the action chosen by a command line option Modified tests/forces/Test_dwf_gpforce,Test_gpdwf_force,Test_gpwilson_force to use GPBC a spatial direction rather than the t-direction, and antiperiodic BCs for time direction tests/core/Test_gparity now supports using APBC in time direction using command line toggle
76 lines
3.3 KiB
C
76 lines
3.3 KiB
C
/*************************************************************************************
|
|
|
|
Grid physics library, www.github.com/paboyle/Grid
|
|
|
|
Source file: ./lib/Algorithms.h
|
|
|
|
Copyright (C) 2015
|
|
|
|
Author: Azusa Yamaguchi <ayamaguc@staffmail.ed.ac.uk>
|
|
Author: Peter Boyle <paboyle@ph.ed.ac.uk>
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program 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 General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License along
|
|
with this program; if not, write to the Free Software Foundation, Inc.,
|
|
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
See the full license in the file "LICENSE" in the top level distribution directory
|
|
*************************************************************************************/
|
|
/* END LEGAL */
|
|
#ifndef GRID_ALGORITHMS_H
|
|
#define GRID_ALGORITHMS_H
|
|
|
|
NAMESPACE_CHECK(algorithms);
|
|
#include <Grid/algorithms/SparseMatrix.h>
|
|
#include <Grid/algorithms/LinearOperator.h>
|
|
#include <Grid/algorithms/Preconditioner.h>
|
|
NAMESPACE_CHECK(SparseMatrix);
|
|
|
|
#include <Grid/algorithms/approx/Zolotarev.h>
|
|
#include <Grid/algorithms/approx/Chebyshev.h>
|
|
#include <Grid/algorithms/approx/JacobiPolynomial.h>
|
|
#include <Grid/algorithms/approx/Remez.h>
|
|
#include <Grid/algorithms/approx/MultiShiftFunction.h>
|
|
#include <Grid/algorithms/approx/Forecast.h>
|
|
#include <Grid/algorithms/approx/RemezGeneral.h>
|
|
#include <Grid/algorithms/approx/ZMobius.h>
|
|
NAMESPACE_CHECK(approx);
|
|
#include <Grid/algorithms/iterative/Deflation.h>
|
|
#include <Grid/algorithms/iterative/ConjugateGradient.h>
|
|
NAMESPACE_CHECK(ConjGrad);
|
|
#include <Grid/algorithms/iterative/BiCGSTAB.h>
|
|
NAMESPACE_CHECK(BiCGSTAB);
|
|
#include <Grid/algorithms/iterative/ConjugateResidual.h>
|
|
#include <Grid/algorithms/iterative/NormalEquations.h>
|
|
#include <Grid/algorithms/iterative/SchurRedBlack.h>
|
|
#include <Grid/algorithms/iterative/ConjugateGradientMultiShift.h>
|
|
#include <Grid/algorithms/iterative/ConjugateGradientMixedPrec.h>
|
|
#include <Grid/algorithms/iterative/ConjugateGradientMultiShiftMixedPrec.h>
|
|
#include <Grid/algorithms/iterative/BiCGSTABMixedPrec.h>
|
|
#include <Grid/algorithms/iterative/BlockConjugateGradient.h>
|
|
#include <Grid/algorithms/iterative/ConjugateGradientReliableUpdate.h>
|
|
#include <Grid/algorithms/iterative/MinimalResidual.h>
|
|
#include <Grid/algorithms/iterative/GeneralisedMinimalResidual.h>
|
|
#include <Grid/algorithms/iterative/CommunicationAvoidingGeneralisedMinimalResidual.h>
|
|
#include <Grid/algorithms/iterative/FlexibleGeneralisedMinimalResidual.h>
|
|
#include <Grid/algorithms/iterative/FlexibleCommunicationAvoidingGeneralisedMinimalResidual.h>
|
|
#include <Grid/algorithms/iterative/MixedPrecisionFlexibleGeneralisedMinimalResidual.h>
|
|
#include <Grid/algorithms/iterative/ImplicitlyRestartedLanczos.h>
|
|
#include <Grid/algorithms/iterative/PowerMethod.h>
|
|
|
|
NAMESPACE_CHECK(PowerMethod);
|
|
#include <Grid/algorithms/CoarsenedMatrix.h>
|
|
NAMESPACE_CHECK(CoarsendMatrix);
|
|
#include <Grid/algorithms/FFT.h>
|
|
|
|
#endif
|