/home/abui...RC/dgesv.f(3)

💅 /home/abui...RC/dgesv.f(3)

okay bestie, welcome to the Library Functions Manual page for /home/abui...RC/dgesv.f(3) — yes that's the whole path, we don't gatekeep here ✨

---

🌸 NAME 🌸

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dgesv.f

that's it. that's the name. she's long, she's got slashes, she's iconic 💅

---

🦋 SYNOPSIS 🦋

Functions/Subroutines

• subroutine DGESV (n, nrhs, a, lda, ipiv, b, ldb, info)

---

👑 Function/Subroutine Documentation 👑

🎀 subroutine DGESV (integer n, integer nrhs, double precision, dimension( lda, * ) a, integer lda, integer, dimension( * ) ipiv, double precision, dimension( ldb, * ) b, integer ldb, integer info)

✨ Purpose:

!>
!> DGESV computes the solution to a real system of linear equations
!>    A * X = B,
!> where A is an N-by-N matrix and X and B are N-by-NRHS matrices.
!>
!> The LU decomposition with partial pivoting and row interchanges is
!> used to factor A as
!>    A = P * L * U,
!> where P is a permutation matrix, L is unit lower triangular, and U is
!> upper triangular.  The factored form of A is then used to solve the
!> system of equations A * X = B.
!>

so basically 🫶 DGESV solves a real system of linear equations A * X = B, where A is an N-by-N matrix and X and B are N-by-NRHS matrices. she factors A using the LU decomposition with partial pivoting and row interchanges, giving you A = P * L * U — where P is a permutation matrix, L is unit lower triangular, and U is upper triangular. then that factored form gets used to solve A * X = B. no cap, that's the whole vibe 💖

🌈 Parameters

• N — N is INTEGER. it's the number of linear equations, i.e. the order of the matrix A. must be N >= 0.
• NRHS — NRHS is INTEGER. the number of right hand sides, i.e. the number of columns of the matrix B. must be NRHS >= 0.
• A — A is DOUBLE PRECISION array, dimension (LDA,N). on entry, it's the N-by-N coefficient matrix A. on exit, it holds the factors L and U from the factorization A = P*L*U — and pssst, the unit diagonal elements of L are not stored 🙈
• LDA — LDA is INTEGER. the leading dimension of the array A. must be LDA >= max(1,N).
• IPIV — IPIV is INTEGER array, dimension (N). the pivot indices that define the permutation matrix P — row i of the matrix was interchanged with row IPIV(i). tracking the drama, one swap at a time 💀
• B — B is DOUBLE PRECISION array, dimension (LDB,NRHS). on entry, it's the N-by-NRHS matrix of right hand side matrix B. on exit, if INFO = 0, it's the N-by-NRHS solution matrix X. glow up ✨
• LDB — LDB is INTEGER. the leading dimension of the array B. must be LDB >= max(1,N).
• INFO — INFO is INTEGER. the vibe check:
  • = 0: successful exit 🎉
  • < 0: if INFO = -i, the i-th argument had an illegal value 😭
  • > 0: if INFO = i, U(i,i) is exactly zero. the factorization has been completed, but the factor U is exactly singular, so the solution could not be computed. she tried, bestie 💀

⭐ Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

Definition at line 123 of file dgesv.f.

---

🧚 Author

Generated automatically by Doxygen for LAPACK from the source code. (not me writing this by hand, the robots did it, and honestly? slay 🤖💅)

---

🫶 bye bestie! this page is from LAPACK, Version 3.12.0, and it lives at /home/abui...RC/dgesv.f(3) — go solve something linear, periodt. 🔥👑