dgesv function

void dgesv(
  1. int N,
  2. int NRHS,
  3. Matrix<double> A_,
  4. int LDA,
  5. Array<int> IPIV_,
  6. Matrix<double> B_,
  7. int LDB,
  8. Box<int> INFO,
)

Implementation

void dgesv(
  final int N,
  final int NRHS,
  final Matrix<double> A_,
  final int LDA,
  final Array<int> IPIV_,
  final Matrix<double> B_,
  final int LDB,
  final Box<int> INFO,
) {
  final A = A_.having(ld: LDA);
  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 (NRHS < 0) {
    INFO.value = -2;
  } else if (LDA < max(1, N)) {
    INFO.value = -4;
  } else if (LDB < max(1, N)) {
    INFO.value = -7;
  }
  if (INFO.value != 0) {
    xerbla('DGESV', -INFO.value);
    return;
  }

  // Compute the LU factorization of A.

  dgetrf(N, N, A, LDA, IPIV, INFO);
  if (INFO.value == 0) {
    // Solve the system A*X = B, overwriting B with X.

    dgetrs('No transpose', N, NRHS, A, LDA, IPIV, B, LDB, INFO);
  }
}