Grid/lib/Algorithms.h

#ifndef GRID_ALGORITHMS_H
#define GRID_ALGORITHMS_H

#include <algorithms/SparseMatrix.h>
#include <algorithms/LinearOperator.h>
#include <algorithms/Preconditioner.h>

#include <algorithms/approx/Zolotarev.h>
#include <algorithms/approx/Chebyshev.h>
#include <algorithms/approx/Remez.h>
#include <algorithms/approx/MultiShiftFunction.h>

#include <algorithms/iterative/ConjugateGradient.h>
#include <algorithms/iterative/ConjugateResidual.h>
#include <algorithms/iterative/NormalEquations.h>
#include <algorithms/iterative/SchurRedBlack.h>

#include <algorithms/iterative/ConjugateGradientMultiShift.h>

// Lanczos support
#include <algorithms/iterative/MatrixUtils.h>
#include <algorithms/iterative/ImplicitlyRestartedLanczos.h>

#include <algorithms/CoarsenedMatrix.h>

// Eigen/lanczos
// EigCg
// MCR
// Pcg
// Multishift CG
// Hdcg
// GCR
// etc..

// integrator/Leapfrog
// integrator/Omelyan
// integrator/ForceGradient

// montecarlo/hmc
// montecarlo/rhmc
// montecarlo/metropolis
// etc...


#endif
Getting closer to having a wilson solver... introducing a first and untested cut at Conjugate gradient. Also copied in Remez, Zolotarev, Chebyshev from Mike Clark, Tony Kennedy and my BFM package respectively since we know we will need these. I wanted the structure of algorithms/approx algorithms/iterative etc.. to start taking shape. 2015-05-18 07:47:05 +01:00			`#ifndef GRID_ALGORITHMS_H`
			`#define GRID_ALGORITHMS_H`

			`#include <algorithms/SparseMatrix.h>`
			`#include <algorithms/LinearOperator.h>`
Variable preconditioned GCR with restarting. Orthogonalisation depth and restart frequency is controllable via constructor 2015-06-21 10:58:46 +01:00			`#include <algorithms/Preconditioner.h>`
Getting closer to having a wilson solver... introducing a first and untested cut at Conjugate gradient. Also copied in Remez, Zolotarev, Chebyshev from Mike Clark, Tony Kennedy and my BFM package respectively since we know we will need these. I wanted the structure of algorithms/approx algorithms/iterative etc.. to start taking shape. 2015-05-18 07:47:05 +01:00
multishift conjugate gradient added and a strong test: take a diagonal but non-identity matrix l1 0 0 0 .... 0 l2 0 0 .... 0 0 l3 0 ... . . . . . . . . . And apply the multishift CG to it. Sum the poles and residues. Insist that this be the same as the exactly taken square root where l1,l2,l3 >= 0. 2015-06-08 11:52:44 +01:00			`#include <algorithms/approx/Zolotarev.h>`
			`#include <algorithms/approx/Chebyshev.h>`
			`#include <algorithms/approx/Remez.h>`
			`#include <algorithms/approx/MultiShiftFunction.h>`

Getting closer to having a wilson solver... introducing a first and untested cut at Conjugate gradient. Also copied in Remez, Zolotarev, Chebyshev from Mike Clark, Tony Kennedy and my BFM package respectively since we know we will need these. I wanted the structure of algorithms/approx algorithms/iterative etc.. to start taking shape. 2015-05-18 07:47:05 +01:00			`#include <algorithms/iterative/ConjugateGradient.h>`
Conjugate residual added 2015-06-05 18:16:25 +01:00			`#include <algorithms/iterative/ConjugateResidual.h>`
Getting closer to having a wilson solver... introducing a first and untested cut at Conjugate gradient. Also copied in Remez, Zolotarev, Chebyshev from Mike Clark, Tony Kennedy and my BFM package respectively since we know we will need these. I wanted the structure of algorithms/approx algorithms/iterative etc.. to start taking shape. 2015-05-18 07:47:05 +01:00			`#include <algorithms/iterative/NormalEquations.h>`
			`#include <algorithms/iterative/SchurRedBlack.h>`

multishift conjugate gradient added and a strong test: take a diagonal but non-identity matrix l1 0 0 0 .... 0 l2 0 0 .... 0 0 l3 0 ... . . . . . . . . . And apply the multishift CG to it. Sum the poles and residues. Insist that this be the same as the exactly taken square root where l1,l2,l3 >= 0. 2015-06-08 11:52:44 +01:00			`#include <algorithms/iterative/ConjugateGradientMultiShift.h>`
Getting closer to having a wilson solver... introducing a first and untested cut at Conjugate gradient. Also copied in Remez, Zolotarev, Chebyshev from Mike Clark, Tony Kennedy and my BFM package respectively since we know we will need these. I wanted the structure of algorithms/approx algorithms/iterative etc.. to start taking shape. 2015-05-18 07:47:05 +01:00
Changes to remove warnings under icc; disambiguate AVX512 from IMCI correctly and drop swizzles in AVX512. Don't know why these compiled. 2015-09-23 13:23:45 +01:00			`// Lanczos support`
Lanczos addition 2015-10-08 23:41:00 +01:00			`#include <algorithms/iterative/MatrixUtils.h>`
			`#include <algorithms/iterative/ImplicitlyRestartedLanczos.h>`
Patches for beginnings of an overlap multigrid 2015-06-20 22:22:56 +01:00
			`#include <algorithms/CoarsenedMatrix.h>`

Getting closer to having a wilson solver... introducing a first and untested cut at Conjugate gradient. Also copied in Remez, Zolotarev, Chebyshev from Mike Clark, Tony Kennedy and my BFM package respectively since we know we will need these. I wanted the structure of algorithms/approx algorithms/iterative etc.. to start taking shape. 2015-05-18 07:47:05 +01:00			`// Eigen/lanczos`
			`// EigCg`
			`// MCR`
			`// Pcg`
			`// Multishift CG`
			`// Hdcg`
			`// GCR`
			`// etc..`

			`// integrator/Leapfrog`
			`// integrator/Omelyan`
			`// integrator/ForceGradient`

			`// montecarlo/hmc`
			`// montecarlo/rhmc`
			`// montecarlo/metropolis`
			`// etc...`


			`#endif`