// Cinvert.java  Cinvert(A[][]) in place

public class Cinvert
{
  Complex Czero = new Complex(0.0,0.0);

  Cinvert(Complex A[][])
  {
    int n = A.length;
    int row[] = new int[n];
    int col[] = new int[n];
    Complex temp[] = new Complex[n];
    int hold , I_pivot , J_pivot;
    Complex pivot;
    double  abs_pivot;

    if(A[0].length!=n)
    {
      System.out.println("Error inverse, inconsistent array sizes.");
    }
    // set up row and column interchange vectors
    for(int k=0; k<n; k++)
    {
      row[k] = k ;
      col[k] = k ;
    }
    // begin main reduction loop
    for(int k=0; k<n; k++)
    {
      // find largest element for pivot
      pivot = A[row[k]][col[k]] ;
      I_pivot = k;
      J_pivot = k;
      for(int i=k; i<n; i++)
      {
        for(int j=k; j<n; j++)
        {
	  abs_pivot = pivot.abs() ;
          if(A[row[i]][col[j]].abs() > abs_pivot)
          {
            I_pivot = i ;
            J_pivot = j ;
            pivot = A[row[i]][col[j]] ;
          }
        }
      }
      if(pivot.abs() < 1.0E-12)
      {
        System.out.println("Matrix near singular! at row "+k+", pivot="+pivot);
        for(int i=k; i<n; i++)
        {
          for(int j=k; j<n; j++)
          {
            A[row[i]][col[j]] = Czero;
	  }
	}
        continue;
      }
      hold = row[k];
      row[k]= row[I_pivot];
      row[I_pivot] = hold ;
      hold = col[k];
      col[k]= col[J_pivot];
      col[J_pivot] = hold ;
      // reduce about pivot
      A[row[k]][col[k]] = pivot.invert() ;
      for(int j=0; j<n; j++)
      {
        if(j != k)
        {
	  A[row[k]][col[j]] = A[row[k]][col[j]].multiply(A[row[k]][col[k]]);
        }
      }
      // inner reduction loop
      for(int i=0; i<n; i++)
      {
        if(k != i)
        {
          for(int j=0; j<n; j++)
          {
            if( k != j )
            {
	      A[row[i]][col[j]] = A[row[i]][col[j]].subtract(
			       A[row[i]][col[k]].multiply(A[row[k]][col[j]]));
            }
          }
          A[row[i]][col [k]] = (A[row[i]][col[k]].multiply(A[row[k]][col[k]]))
				.negate();
        }
      }
    } // k
    // end main reduction loop

    // unscramble rows
    for(int j=0; j<n; j++)
    {
      for(int i=0; i<n; i++)
      {
        temp[col[i]] = A[row[i]][j];
      }
      for(int i=0; i<n; i++)
      {
        A[i][j] = temp[i] ;
      }
    }
    // unscramble columns
    for(int i=0; i<n; i++)
    {
      for(int j=0; j<n; j++)
      {
        temp[row[j]] = A[i][col[j]] ;
      }
      for(int j=0; j<n; j++)
      {
        A[i][j] = temp[j] ;
      }
    }
  } // end Cinvert
} // end class Cinvert