zgbsv function

void zgbsv(
  1. int N,
  2. int KL,
  3. int KU,
  4. int NRHS,
  5. Matrix<Complex> AB_,
  6. int LDAB,
  7. Array<int> IPIV_,
  8. Matrix<Complex> B_,
  9. int LDB,
  10. Box<int> INFO,
)

Implementation

void zgbsv(
  final int N,
  final int KL,
  final int KU,
  final int NRHS,
  final Matrix<Complex> AB_,
  final int LDAB,
  final Array<int> IPIV_,
  final Matrix<Complex> B_,
  final int LDB,
  final Box<int> INFO,
) {
  final AB = AB_.having(ld: LDAB);
  final IPIV = IPIV_.having();
  final B = B_.having(ld: LDB);

  // Test the input parameters.

  INFO.value = 0;
  if (N < 0) {
    INFO.value = -1;
  } else if (KL < 0) {
    INFO.value = -2;
  } else if (KU < 0) {
    INFO.value = -3;
  } else if (NRHS < 0) {
    INFO.value = -4;
  } else if (LDAB < 2 * KL + KU + 1) {
    INFO.value = -6;
  } else if (LDB < max(N, 1)) {
    INFO.value = -9;
  }
  if (INFO.value != 0) {
    xerbla('ZGBSV', -INFO.value);
    return;
  }

  // Compute the LU factorization of the band matrix A.

  zgbtrf(N, N, KL, KU, AB, LDAB, IPIV, INFO);
  if (INFO.value == 0) {
    // Solve the system A*X = B, overwriting B with X.

    zgbtrs('No transpose', N, KL, KU, NRHS, AB, LDAB, IPIV, B, LDB, INFO);
  }
}