SRC/cgesc2.f(3)

πŸ’… NAME πŸ’…

SRC/cgesc2.f β€” bestie, this is the page for the cgesc2 subroutine, and no cap, it's a whole vibe ✨


🌸 SYNOPSIS 🌸

πŸŽ€ Functions/Subroutines

subroutine cgesc2 (n, a, lda, rhs, ipiv, jpiv, scale)

CGESC2 solves a system of linear equations using the LU factorization with complete pivoting computed by sgetc2. Lowkey iconic 🫢


✨ Function/Subroutine Documentation ✨

subroutine cgesc2 (integer n, complex, dimension( lda, * ) a, integer lda,
    complex, dimension( * ) rhs, integer, dimension( * ) ipiv, integer,
    dimension( * ) jpiv, real scale)

CGESC2 solves a system of linear equations using the LU factorization with complete pivoting computed by sgetc2. Like, that's the whole gig, and she does it well πŸ’–

πŸ¦‹ Purpose:

!> !> CGESC2 solves a system of linear equations !> !> A * X = scale* RHS !> !> with a general N-by-N matrix A using the LU factorization with !> complete pivoting computed by CGETC2. !> !>

🌈 Parameters

  • N β€” okay so N is INTEGER and it's literally the number of columns of the matrix A.
!> N is INTEGER !> The number of columns of the matrix A. !>
  • A β€” A is a COMPLEX array, dimension (LDA, N). On entry it's holding the LU part of the factorization of the n-by-n matrix A computed by CGETC2: A = P * L * U * Q πŸ‘‘
!> A is COMPLEX array, dimension (LDA, N) !> On entry, the LU part of the factorization of the n-by-n !> matrix A computed by CGETC2: A = P * L * U * Q !>
  • LDA β€” LDA is INTEGER, the leading dimension of the array A. Rules are rules: LDA >= max(1, N). Periodt.
!> LDA is INTEGER !> The leading dimension of the array A. LDA >= max(1, N). !>
  • RHS β€” RHS is a COMPLEX array, dimension N. On entry it's the right hand side vector b. On exit? It's the solution vector X β€” glow-up moment fr fr ✨
!> RHS is COMPLEX array, dimension N. !> On entry, the right hand side vector b. !> On exit, the solution vector X. !>
  • IPIV β€” IPIV is INTEGER array, dimension (N). These are the pivot indices; for 1 <= i <= N, row i of the matrix has been interchanged with row IPIV(i).
!> IPIV is INTEGER array, dimension (N). !> The pivot indices; for 1 <= i <= N, row i of the !> matrix has been interchanged with row IPIV(i). !>
  • JPIV β€” JPIV is INTEGER array, dimension (N). Also pivot indices, but for the columns this time: for 1 <= j <= N, column j of the matrix has been interchanged with column JPIV(j) πŸ’…
!> JPIV is INTEGER array, dimension (N). !> The pivot indices; for 1 <= j <= N, column j of the !> matrix has been interchanged with column JPIV(j). !>
  • SCALE β€” SCALE is REAL. On exit, SCALE contains the scale factor. SCALE is chosen so that 0 <= SCALE <= 1 to prevent overflow in the solution β€” she's out here protecting you from overflow, we stan πŸ›‘οΈ
!> SCALE is REAL !> On exit, SCALE contains the scale factor. SCALE is chosen !> 0 <= SCALE <= 1 to prevent overflow in the solution. !>

πŸ‘‘ Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

🧚 Contributors:

Bo Kagstrom and Peter Poromaa, Department of Computing Science, Umea University, S-901 87 Umea, Sweden.

Definition at line 114 of file cgesc2.f.


πŸ’œ Author

Generated automatically by Doxygen for LAPACK from the source code.


That's the whole page bestie, no skips, no summarising, we read every line πŸ’–

LAPACK β€” Version 3.12.0 β€” SRC/cgesc2.f(3)

okay that's it, hope this slayed for you πŸŽ€βœ¨πŸ¦‹

πŸ“¦ where this page comes from