Sherman-Morrison/src/SM_MaponiA3.cpp

// SM-MaponiA3_f.cpp
// Algorithm 3 from P. Maponi,
// p. 283, doi:10.1016/j.laa.2006.07.007
#include "SM_MaponiA3.hpp"
#include "Helpers.hpp"

void selectBestUpdate(unsigned int l, unsigned int N_updates, 
                      unsigned int *Updates_index, unsigned int *p, 
                      double ***ylk) {
  unsigned int lbar = l+1, max =0;
  unsigned int index = 0, component = 0;
  unsigned int tmp = 0;
  double breakdown = 0;
  for (unsigned int j = lbar; j < N_updates + 1; j++) {
    index = p[j];
    component = Updates_index[index - 1];
    breakdown = abs(1 + ylk[l][index][component]);
    #ifdef DEBUG
    cout << "Inside selectBestUpdate()" << endl;
    cout << "breakdown = abs(1 + ylk[" << l << "][" << index << "][" << component << "]) = " << breakdown << endl;
    cout << endl;
    #endif
    if (breakdown > max) {
      max = breakdown;
      lbar = j;
    }
  }
  tmp = p[l+1];
  p[l+1] = p[lbar];
  p[lbar] = tmp; 
}

void MaponiA3(double *Slater_inv, unsigned int Dim,
              unsigned int N_updates, double *Updates,
              unsigned int *Updates_index) {

  /*
  DECLARE AND INITIALISE ARRAYS
  */

  unsigned int k, l, i, j, component;
  unsigned int *p = new unsigned int[N_updates + 1] {0};
  double alpha, beta;
  double *Al = new double[Dim * Dim];
  double *next = new double[Dim*Dim] {0};
  double *last = Slater_inv, *tmp;

  // Populate update-order vector
  for (i = 0; i < N_updates; i++) {
    p[i + 1] = i + 1;
  }

  // Declare auxiliary solution matrix ylk[N_updates][N_updates+1][Dim]
  double ***ylk = new double **[N_updates];
  for (l = 0; l < N_updates; l++) {
    ylk[l] = new double *[N_updates + 1];
    for (k = 0; k < N_updates + 1; k++) {
      ylk[l][k] = new double[Dim + 1] {0};
    }
  }



  /*
  START ALGORITHM
  */

  // Calculate the {y_{0,k}}
  for (k = 1; k < N_updates + 1; k++) {
    #ifdef DEBUG
    cout << "Compute y0k: " << endl;
    cout << "ylk[0][" << k << "][:]";
    cout << endl;
    #endif
    for (i = 1; i < Dim + 1; i++) {
      for (j = 1; j < Dim + 1; j++) {
        ylk[0][k][i] += Slater_inv[(i-1)*Dim + (j-1)]
                      * Updates[(k-1)*Dim + (j-1)];
      }
    }
    #ifdef DEBUG
    showVector(ylk[0][k], Dim, "");
    #endif
  }

  // Calculate the {y_{l,k}} from the {y_{0,k}}
  for (l = 0; l < N_updates; l++) {
    #ifdef DEBUG
    cout << "In outer compute-ylk-loop: l = " << l << endl;
    cout << endl;
    #endif

    // For given l select intermediate update with largest break-down val
    selectBestUpdate(l, N_updates, Updates_index, p, ylk);

    // Select component and comp. bd-condition.
    component = Updates_index[p[l+1] - 1];
    beta = 1 + ylk[l][p[l+1]][component];
    #ifdef DEBUG
    cout << "p[l+1] = " << p[l+1] << endl;
    cout << "component = " << component << endl;
    cout << "beta = 1 + ylk[" << l << "][" << p[l+1] << "][" << component << "] = " << beta << endl;
    cout << endl;
    #endif
    if (fabs(beta) < 1e-6) {
      cout << "Break-down occured. Exiting..." << endl;
      exit(1);
    }

    // Compute intermediate update to Slater_inv
    #ifdef DEBUG
    cout << "Compute intermediate update to Slater_inv" << endl;
    cout << "component = " << component << endl;
    cout << "beta = 1 + ylk[" << l << "][" << p[l+1] << "][" << component << "]" << endl;
    cout << "ylk[l][p[k]][:] = ylk[" << l << "][" << p[l+1] << "][:]" << endl;
    cout << endl;
    #endif
    for (i = 0; i < Dim; i++) {
      for (j = 0; j < Dim; j++) {
        Al[i*Dim + j] = (i == j) - (j == component-1)
                      * ylk[l][p[l+1]][i + 1] / beta;
      }
    }
    matMul(Al, last, next, Dim);
    tmp = next;
    next = last;
    last = tmp;
    #ifdef DEBUG
    showMatrix(last, Dim, "last");
    #endif

    // For given l != 0 compute the next {y_{l,k}}
    for (k = l+2; k < N_updates+1; k++) {
      alpha = ylk[l][p[k]][component] / beta;
      #ifdef DEBUG
      cout << "Inside k-loop: k = " << k << endl;
      cout << "ylk[" << l+1 << "][" << p[k] << "][:]" << endl;
      cout << endl;
      #endif
      for (i = 1; i < Dim + 1; i++) {
        ylk[l+1][p[k]][i] = ylk[l][p[k]][i]
                        - alpha * ylk[l][p[l+1]][i];
      }
    }
  }
  memcpy(Slater_inv, last, Dim*Dim*sizeof(double));



  /*
  CLEANUP MEMORY
  */
  
  for (l = 0; l < N_updates; l++) {
    for (k = 0; k < N_updates + 1; k++) {
      delete[] ylk[l][k];
    }
    delete[] ylk[l];
  }
  delete[] Al, next, p;
}

extern "C" {
  void MaponiA3_f(double **linSlater_inv, unsigned int *Dim,
                  unsigned int *N_updates, double **linUpdates,
                  unsigned int **Updates_index) {
    MaponiA3(*linSlater_inv, *Dim,
             *N_updates, *linUpdates,
             *Updates_index);
  }
}