inv_mre.cpp

Go to the documentation of this file.

#include <invert_quda.h>
#include <blas_quda.h>
#include <eigen_helper.h>
 
namespace quda {
 
  MinResExt::MinResExt(const DiracMatrix &mat, bool orthogonal, bool apply_mat, bool hermitian, TimeProfile &profile) :
    mat(mat),
    orthogonal(orthogonal),
    apply_mat(apply_mat),
    hermitian(hermitian),
    profile(profile)
  {
  }
 
  MinResExt::~MinResExt() {
 
  }
 
  /* Solve the equation A p_k psi_k = b by minimizing the residual and
     using Eigen's SVD algorithm for numerical stability */
  void MinResExt::solve(Complex *psi_, std::vector<ColorSpinorField*> &p,
                        std::vector<ColorSpinorField*> &q, ColorSpinorField &b, bool hermitian)
  {
    typedef Matrix<Complex, Dynamic, Dynamic> matrix;
    typedef Matrix<Complex, Dynamic, 1> vector;
 
    const int N = q.size();
    vector phi(N), psi(N);
    matrix A(N,N);
 
    // form the a Nx(N+1) matrix using only a single reduction - this
    // presently requires forgoing the matrix symmetry, but the improvement is well worth it
    std::vector<ColorSpinorField*> Q;
    for (int i=0; i<N; i++) Q.push_back(q[i]);
    Q.push_back(&b);
 
    Complex *A_ = new Complex[N*(N+1)];
 
    if (hermitian) {
      // linear system is Hermitian, solve directly
      // compute rhs vector phi = P* b = (q_i, b) and construct the matrix
      // P* Q = P* A P = (p_i, q_j) = (p_i, A p_j)
      blas::cDotProduct(A_, p, Q);
    } else {
      // linear system is not Hermitian, solve the normal system
      // compute rhs vector phi = Q* b = (q_i, b) and construct the matrix
      // Q* Q = (A P)* (A P) = (q_i, q_j) = (A p_i, A p_j)
      blas::cDotProduct(A_, q, Q);
    }
 
    for (int i=0; i<N; i++) {
      phi(i) = A_[i*(N+1)+N];
      for (int j=0; j<N; j++) {
        A(i,j) = A_[i*(N+1)+j];
      }
    }
 
    delete []A_;
 
    profile.TPSTOP(QUDA_PROFILE_CHRONO);
    profile.TPSTART(QUDA_PROFILE_EIGEN);
 
    LDLT<matrix> cholesky(A);
    psi = cholesky.solve(phi);
 
    profile.TPSTOP(QUDA_PROFILE_EIGEN);
    profile.TPSTART(QUDA_PROFILE_CHRONO);
 
    for (int i=0; i<N; i++) psi_[i] = psi(i);
  }
 
 
  /*
    We want to find the best initial guess of the solution of
    A x = b, and we have N previous solutions x_i.
    The method goes something like this:
    
    1. Orthonormalise the p_i and q_i
    2. Form the matrix G_ij = x_i^dagger A x_j
    3. Form the vector B_i = x_i^dagger b
    4. solve A_ij a_j  = B_i
    5. x = a_i p_i
  */
  void MinResExt::operator()(ColorSpinorField &x, ColorSpinorField &b, 
                             std::vector<ColorSpinorField*> p, std::vector<ColorSpinorField*> q) {
 
    bool running = profile.isRunning(QUDA_PROFILE_CHRONO);
    if (!running) profile.TPSTART(QUDA_PROFILE_CHRONO);
 
    const int N = p.size();
 
    if (getVerbosity() >= QUDA_VERBOSE)
      printfQuda("Constructing minimum residual extrapolation with basis size %d\n", N);
 
    // if no guess is required, then set initial guess = 0
    if (N == 0) {
      blas::zero(x);
      if (!running) profile.TPSTOP(QUDA_PROFILE_CHRONO);
      return;
    }
 
    if (N == 1) {
      blas::copy(x, *p[0]);
      if (!running) profile.TPSTOP(QUDA_PROFILE_CHRONO);
      return;
    }
 
    // Solution coefficient vectors
    Complex *alpha = new Complex[N];
 
    double b2 = getVerbosity() >= QUDA_SUMMARIZE ? blas::norm2(b) : 0.0;
 
    // Orthonormalise the vector basis
    if (orthogonal) {
      for (int i=0; i<N; i++) {
        double p2 = blas::norm2(*p[i]);
        blas::ax(1 / sqrt(p2), *p[i]);
        if (!apply_mat) blas::ax(1 / sqrt(p2), *q[i]);
 
        if (i+1<N) {
          std::vector<ColorSpinorField*> Pi;
          Pi.push_back(p[i]);
          std::vector<ColorSpinorField*> P;
          for (int j=i+1; j<N; j++) P.push_back(p[j]);
          blas::cDotProduct(alpha+i+1, Pi, P); // single multi reduction
          for (int j=i+1; j<N; j++) alpha[j] = -alpha[j];
          blas::caxpy(alpha+i+1, Pi, P); // single block Pj update
 
          if (!apply_mat) {
            // if not applying the matrix below then orthongonalize q
            std::vector<ColorSpinorField*> X;
            X.push_back(q[i]);
            std::vector<ColorSpinorField*> Y;
            for (int j=i+1; j<N; j++) { Y.push_back(q[j]); }
            blas::caxpy(alpha+i+1, X, Y); // single block Qj update
          }
        }
      }
    }
 
    // if operator hasn't already been applied then apply
    if (apply_mat) for (int i=0; i<N; i++) mat(*q[i], *p[i]);
 
    solve(alpha, p, q, b, hermitian);
 
    blas::zero(x);
    std::vector<ColorSpinorField*> X;
    X.push_back(&x);
    blas::caxpy(alpha, p, X);
 
    if (getVerbosity() >= QUDA_SUMMARIZE) {
      // compute the residual only if we're going to print it
      for (int i=0; i<N; i++) alpha[i] = -alpha[i];
      std::vector<ColorSpinorField*> B;
      B.push_back(&b);
      blas::caxpy(alpha, q, B);
 
      double rsd = sqrt(blas::norm2(b) / b2 );
      printfQuda("MinResExt: N = %d, |res| / |src| = %e\n", N, rsd);
    }
 
    delete [] alpha;
 
    if (!running) profile.TPSTOP(QUDA_PROFILE_CHRONO);
  }
 
  // Wrapper for the above
  void MinResExt::operator()(ColorSpinorField &x, ColorSpinorField &b, std::vector<std::pair<ColorSpinorField*,ColorSpinorField*> > basis) {
    std::vector<ColorSpinorField*> p(basis.size()), q(basis.size());
    for (unsigned int i=0; i<basis.size(); i++) { p[i] = basis[i].first; q[i] = basis[i].second; }
    (*this)(x, b, p, q);
  }
 
 
 
} // namespace quda