mirror of
https://github.com/paboyle/Grid.git
synced 2024-09-20 17:25:37 +01:00
a8b9109cc8
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.
38 lines
751 B
C
38 lines
751 B
C
#ifndef GRID_ALGORITHMS_H
|
|
#define GRID_ALGORITHMS_H
|
|
|
|
#include <algorithms/SparseMatrix.h>
|
|
#include <algorithms/LinearOperator.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/NormalEquations.h>
|
|
#include <algorithms/iterative/SchurRedBlack.h>
|
|
|
|
#include <algorithms/iterative/ConjugateGradientMultiShift.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
|