dtptrs function

Implementation

void dtptrs(
  final String UPLO,
  final String TRANS,
  final String DIAG,
  final int N,
  final int NRHS,
  final Array<double> AP_,
  final Matrix<double> B_,
  final int LDB,
  final Box<int> INFO,
) {
  final AP = AP_.having();
  final B = B_.having(ld: LDB);
  const ZERO = 0.0;
  bool NOUNIT, UPPER;
  int J, JC;

  // Test the input parameters.

  INFO.value = 0;
  UPPER = lsame(UPLO, 'U');
  NOUNIT = lsame(DIAG, 'N');
  if (!UPPER && !lsame(UPLO, 'L')) {
    INFO.value = -1;
  } else if (!lsame(TRANS, 'N') && !lsame(TRANS, 'T') && !lsame(TRANS, 'C')) {
    INFO.value = -2;
  } else if (!NOUNIT && !lsame(DIAG, 'U')) {
    INFO.value = -3;
  } else if (N < 0) {
    INFO.value = -4;
  } else if (NRHS < 0) {
    INFO.value = -5;
  } else if (LDB < max(1, N)) {
    INFO.value = -8;
  }
  if (INFO.value != 0) {
    xerbla('DTPTRS', -INFO.value);
    return;
  }

  // Quick return if possible

  if (N == 0) return;

  // Check for singularity.

  if (NOUNIT) {
    if (UPPER) {
      JC = 1;
      for (INFO.value = 1; INFO.value <= N; INFO.value++) {
        if (AP[JC + INFO.value - 1] == ZERO) return;
        JC += INFO.value;
      }
    } else {
      JC = 1;
      for (INFO.value = 1; INFO.value <= N; INFO.value++) {
        if (AP[JC] == ZERO) return;
        JC += N - INFO.value + 1;
      }
    }
  }
  INFO.value = 0;

  // Solve A * x = b  or  A**T * x = b.

  for (J = 1; J <= NRHS; J++) {
    dtpsv(UPLO, TRANS, DIAG, N, AP, B(1, J).asArray(), 1);
  }
}