Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse files

This commit was manufactured by cvs2svn to create tag 'rel-5-0-1'.

  • Loading branch information...
commit b5c5000292a0f21988b6cf522a1fbc5f4e315a8c 1 parent 0921e0b
cvs2svn authored
Showing with 0 additions and 136 deletions.
  1. +0 −42 README.phmc
  2. +0 −66 linalg/deri_linalg.c
  3. +0 −28 linalg/deri_linalg.h
View
42 README.phmc
@@ -1,42 +0,0 @@
-See doc/2+1+1_howto.text for more details
-
-as a test the following parameter set can be used (see also
-sample-input/sample-hmc2.input):
-Kappa = 0.170
-2KappaMu = 0.01
-2Kappamubar = 0.1105
-2Kappaepsbar = 0.0935
-beta=3.3
-tlsym gauge action
-antiperiodic boundary conditions for quark fields
-
-P = 0.53347(17)
-P_rec = 0.30393(22)
-
-
-How it roughly works:
-- Decide for a fixed order n of the less accurate polynomial
- P
-- Decide also for an approximation interval
-- compute the n roots of the polynomial using the programme
- in util/laguer/
- This will store the monomials in Square_root_BR_roots.dat
- and the normalisation factor in normierungLocal.dat
-- the normalisation factor in the latter file corresponds
- to n-th root of C_total. In the monomial repr. the square
- root of this is needed. This rooting is done in phmc_tm.c
-- the polynomial approximates 1/sqrt(x)
-- copy the files normierungLocal.dat and Square_root_BR_roots.dat
- to your running directory
-- the order used in the PHMC for P must be fixed to the same
- order as used for the root computation (or vice versa)
-
-
-todo:
-- fixed order of P as input parameter
-- maybe more meaningful names for input/output files?
-- generic way to use n_f=2 PHMC degenerate and non-degenerate
-- eigenvalue computation - in parallel?
- - on BG/L?
-- reduce memory usage?
-
View
66 linalg/deri_linalg.c
@@ -1,66 +0,0 @@
-/***********************************************************************
- * Copyright (C) 2002,2003,2004,2005,2006,2007,2008 Carsten Urbach
- *
- * This file is part of tmLQCD.
- *
- * tmLQCD 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 3 of the License, or
- * (at your option) any later version.
- *
- * tmLQCD 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 tmLQCD. If not, see <http://www.gnu.org/licenses/>.
- ***********************************************************************/
-/* $Id$ */
-
-#ifdef HAVE_CONFIG_H
-# include<config.h>
-#endif
-#include <stdlib.h>
-#include "su3.h"
-#include "deri_linalg.h"
-
-void deri_linalg(spinor * const R, const double c1, spinor * const S, const double c2, spinor * const U, const int N) {
- int ix;
- spinor *r,*s,*t;
-
- /* Change due to even-odd preconditioning : VOLUME to VOLUME/2 */
- for (ix = 0; ix < N; ix++) {
- r=R+ix;
- s=S+ix;
- t=U+ix;
-
- (*r).s0.c0.re = c1*(*s).s0.c0.re + c2*(*t).s0.c0.re;
- (*r).s0.c0.im = c1*(*s).s0.c0.im + c2*(*t).s0.c0.im;
- (*r).s0.c1.re = c1*(*s).s0.c1.re + c2*(*t).s0.c1.re;
- (*r).s0.c1.im = c1*(*s).s0.c1.im + c2*(*t).s0.c1.im;
- (*r).s0.c2.re = c1*(*s).s0.c2.re + c2*(*t).s0.c2.re;
- (*r).s0.c2.im = c1*(*s).s0.c2.im + c2*(*t).s0.c2.im;
-
- (*r).s1.c0.re = c1*(*s).s1.c0.re + c2*(*t).s1.c0.re;
- (*r).s1.c0.im = c1*(*s).s1.c0.im + c2*(*t).s1.c0.im;
- (*r).s1.c1.re = c1*(*s).s1.c1.re + c2*(*t).s1.c1.re;
- (*r).s1.c1.im = c1*(*s).s1.c1.im + c2*(*t).s1.c1.im;
- (*r).s1.c2.re = c1*(*s).s1.c2.re + c2*(*t).s1.c2.re;
- (*r).s1.c2.im = c1*(*s).s1.c2.im + c2*(*t).s1.c2.im;
-
- (*r).s2.c0.re = c1*(*s).s2.c0.re - c2*(*t).s2.c0.re;
- (*r).s2.c0.im = c1*(*s).s2.c0.im - c2*(*t).s2.c0.im;
- (*r).s2.c1.re = c1*(*s).s2.c1.re - c2*(*t).s2.c1.re;
- (*r).s2.c1.im = c1*(*s).s2.c1.im - c2*(*t).s2.c1.im;
- (*r).s2.c2.re = c1*(*s).s2.c2.re - c2*(*t).s2.c2.re;
- (*r).s2.c2.im = c1*(*s).s2.c2.im - c2*(*t).s2.c2.im;
-
- (*r).s3.c0.re = c1*(*s).s3.c0.re - c2*(*t).s3.c0.re;
- (*r).s3.c0.im = c1*(*s).s3.c0.im - c2*(*t).s3.c0.im;
- (*r).s3.c1.re = c1*(*s).s3.c1.re - c2*(*t).s3.c1.re;
- (*r).s3.c1.im = c1*(*s).s3.c1.im - c2*(*t).s3.c1.im;
- (*r).s3.c2.re = c1*(*s).s3.c2.re - c2*(*t).s3.c2.re;
- (*r).s3.c2.im = c1*(*s).s3.c2.im - c2*(*t).s3.c2.im;
- }
-}
View
28 linalg/deri_linalg.h
@@ -1,28 +0,0 @@
-/***********************************************************************
- * Copyright (C) 2002,2003,2004,2005,2006,2007,2008 Carsten Urbach
- *
- * This file is part of tmLQCD.
- *
- * tmLQCD 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 3 of the License, or
- * (at your option) any later version.
- *
- * tmLQCD 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 tmLQCD. If not, see <http://www.gnu.org/licenses/>.
- ***********************************************************************/
-/* $Id$ */
-
-#ifndef DERI_LINALG_H
-#define DERI_LINALG_H
-
-#include "su3.h"
-
-void deri_linalg(spinor * const R, const double c1, spinor * const S, const double c2, spinor * const U, const int N);
-
-#endif
Please sign in to comment.
Something went wrong with that request. Please try again.