zhpgv function

void zhpgv(
  1. int ITYPE,
  2. String JOBZ,
  3. String UPLO,
  4. int N,
  5. Array<Complex> AP_,
  6. Array<Complex> BP_,
  7. Array<double> W_,
  8. Matrix<Complex> Z_,
  9. int LDZ,
  10. Array<Complex> WORK_,
  11. Array<double> RWORK_,
  12. Box<int> INFO,
)

Implementation

void zhpgv(
  final int ITYPE,
  final String JOBZ,
  final String UPLO,
  final int N,
  final Array<Complex> AP_,
  final Array<Complex> BP_,
  final Array<double> W_,
  final Matrix<Complex> Z_,
  final int LDZ,
  final Array<Complex> WORK_,
  final Array<double> RWORK_,
  final Box<int> INFO,
) {
  final Z = Z_.having(ld: LDZ);
  final W = W_.having();
  final AP = AP_.having();
  final BP = BP_.having();
  final WORK = WORK_.having();
  final RWORK = RWORK_.having();

  bool UPPER, WANTZ;
  String TRANS;
  int J, NEIG;

  // Test the input parameters.

  WANTZ = lsame(JOBZ, 'V');
  UPPER = lsame(UPLO, 'U');

  INFO.value = 0;
  if (ITYPE < 1 || ITYPE > 3) {
    INFO.value = -1;
  } else if (!(WANTZ || lsame(JOBZ, 'N'))) {
    INFO.value = -2;
  } else if (!(UPPER || lsame(UPLO, 'L'))) {
    INFO.value = -3;
  } else if (N < 0) {
    INFO.value = -4;
  } else if (LDZ < 1 || (WANTZ && LDZ < N)) {
    INFO.value = -9;
  }
  if (INFO.value != 0) {
    xerbla('ZHPGV', -INFO.value);
    return;
  }

  // Quick return if possible

  if (N == 0) return;

  // Form a Cholesky factorization of B.

  zpptrf(UPLO, N, BP, INFO);
  if (INFO.value != 0) {
    INFO.value = N + INFO.value;
    return;
  }

  // Transform problem to standard eigenvalue problem and solve.

  zhpgst(ITYPE, UPLO, N, AP, BP, INFO);
  zhpev(JOBZ, UPLO, N, AP, W, Z, LDZ, WORK, RWORK, INFO);

  if (WANTZ) {
    // Backtransform eigenvectors to the original problem.

    NEIG = N;
    if (INFO.value > 0) NEIG = INFO.value - 1;
    if (ITYPE == 1 || ITYPE == 2) {
      // For A*x=(lambda)*B*x and A*B*x=(lambda)*x;
      // backtransform eigenvectors: x = inv(L)**H *y or inv(U)*y

      if (UPPER) {
        TRANS = 'N';
      } else {
        TRANS = 'C';
      }

      for (J = 1; J <= NEIG; J++) {
        ztpsv(UPLO, TRANS, 'Non-unit', N, BP, Z(1, J).asArray(), 1);
      }
    } else if (ITYPE == 3) {
      // For B*A*x=(lambda)*x;
      // backtransform eigenvectors: x = L*y or U**H *y

      if (UPPER) {
        TRANS = 'C';
      } else {
        TRANS = 'N';
      }

      for (J = 1; J <= NEIG; J++) {
        ztpmv(UPLO, TRANS, 'Non-unit', N, BP, Z(1, J).asArray(), 1);
      }
    }
  }
}