zgeqr2p function

void zgeqr2p(
  1. int M,
  2. int N,
  3. Matrix<Complex> A_,
  4. int LDA,
  5. Array<Complex> TAU_,
  6. Array<Complex> WORK_,
  7. Box<int> INFO,
)

Implementation

void zgeqr2p(
  final int M,
  final int N,
  final Matrix<Complex> A_,
  final int LDA,
  final Array<Complex> TAU_,
  final Array<Complex> WORK_,
  final Box<int> INFO,
) {
  final A = A_.having(ld: LDA);
  final TAU = TAU_.having();
  final WORK = WORK_.having();
  int I, K;
  Complex ALPHA;

  // Test the input arguments

  INFO.value = 0;
  if (M < 0) {
    INFO.value = -1;
  } else if (N < 0) {
    INFO.value = -2;
  } else if (LDA < max(1, M)) {
    INFO.value = -4;
  }
  if (INFO.value != 0) {
    xerbla('ZGEQR2P', -INFO.value);
    return;
  }

  K = min(M, N);

  for (I = 1; I <= K; I++) {
    // Generate elementary reflector H(i) to annihilate A(i+1:m,i)

    zlarfgp(M - I + 1, A(I, I), A(min(I + 1, M), I).asArray(), 1, TAU(I));
    if (I < N) {
      // Apply H(i)**H to A(i:m,i+1:n) from the left

      ALPHA = A[I][I];
      A[I][I] = Complex.one;
      zlarf('Left', M - I + 1, N - I, A(I, I).asArray(), 1, TAU[I].conjugate(),
          A(I, I + 1), LDA, WORK);
      A[I][I] = ALPHA;
    }
  }
}