la_gerpvgrw(3)

πŸ’… la_gerpvgrw(3) πŸ’…

okay bestie, welcome to the Library Functions Manual page for la_gerpvgrw β€” title is right there, manual name is folded in near the top, we love a lowkey header moment πŸ’–. This page is all about reciprocal pivot growth, and we’re keeping every function, every parameter, every author credit, and every Definition at line ... of file ... because we are thorough and iconic. periodt.

πŸŽ€ NAME πŸŽ€

la_gerpvgrw β€” la_gerpvgrw: reciprocal pivot growth. That’s the name, that’s the vibe: reciprocal pivot growth, no cap πŸ’….

✨ SYNOPSIS ✨

🌈 Functions 🌈

here’s the whole lineup, bestie β€” signatures verbatim because we do not play with code:

real function cla_gerpvgrw (n, ncols, a, lda, af, ldaf)
    CLA_GERPVGRW multiplies a square real matrix by a complex matrix.
double precision function dla_gerpvgrw (n, ncols, a, lda, af, ldaf)
    DLA_GERPVGRW
real function sla_gerpvgrw (n, ncols, a, lda, af, ldaf)
    SLA_GERPVGRW
double precision function zla_gerpvgrw (n, ncols, a, lda, af, ldaf)
    ZLA_GERPVGRW multiplies a square real matrix by a complex matrix.

πŸ¦‹ Detailed Description πŸ¦‹

no extra lore here β€” the page goes straight into the function documentation. keep scrolling, bestie, the four function breakdowns are right below 🫢.

🌸 Function Documentation 🌸

πŸ’œ real function cla_gerpvgrw πŸ’œ

real function cla_gerpvgrw (integer n, integer ncols, complex, dimension( lda, * ) a, integer lda, complex, dimension( ldaf, * ) af, integer ldaf)

CLA_GERPVGRW multiplies a square real matrix by a complex matrix. yes, that’s the one-liner, and yes, we’re keeping it exactly as the page says.

Purpose:

okay so CLA_GERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U). The page literally says The norm is used. with a double space and no norm type named, so I’m not guessing a norm β€” I’m just holding the source’s hand and keeping it as-is πŸ’€. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix A could be poor. This also means that the solution X, estimated condition numbers, and error bounds could be unreliable. that’s the important caveat, bestie β€” don’t ignore it.

Parameters:

  • N β€” N is INTEGER. The number of linear equations, i.e., the order of the matrix A. N >= 0.
  • NCOLS β€” NCOLS is INTEGER. The number of columns of the matrix A. NCOLS >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,N). On entry, the N-by-N matrix A.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • AF β€” AF is COMPLEX array, dimension (LDAF,N). The factors L and U from the factorization A = P*L*U as computed by CGETRF.
  • LDAF β€” LDAF is INTEGER. The leading dimension of the array AF. LDAF >= max(1,N).

Author:

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition: Definition at line 97 of file cla_gerpvgrw.f.


πŸ’™ double precision function dla_gerpvgrw πŸ’™

double precision function dla_gerpvgrw (integer n, integer ncols, double precision, dimension( lda, * ) a, integer lda, double precision, dimension( ldaf, * ) af, integer ldaf)

DLA_GERPVGRW β€” that’s the entire one-liner description, and we respect the minimalism.

Purpose:

DLA_GERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U). The source says The norm is used. β€” same double-space situation, same refusal to invent a norm type πŸ™ˆ. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix A could be poor. This also means that the solution X, estimated condition numbers, and error bounds could be unreliable. technical caveat, still loud and clear.

Parameters:

  • N β€” N is INTEGER. The number of linear equations, i.e., the order of the matrix A. N >= 0.
  • NCOLS β€” NCOLS is INTEGER. The number of columns of the matrix A. NCOLS >= 0.
  • A β€” A is DOUBLE PRECISION array, dimension (LDA,N). On entry, the N-by-N matrix A.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • AF β€” AF is DOUBLE PRECISION array, dimension (LDAF,N). The factors L and U from the factorization A = P*L*U as computed by DGETRF.
  • LDAF β€” LDAF is INTEGER. The leading dimension of the array AF. LDAF >= max(1,N).

Author:

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition: Definition at line 98 of file dla_gerpvgrw.f.


πŸ’– real function sla_gerpvgrw πŸ’–

real function sla_gerpvgrw (integer n, integer ncols, real, dimension( lda, * ) a, integer lda, real, dimension( ldaf, * ) af, integer ldaf)

SLA_GERPVGRW β€” again, the one-liner is just the name, and honestly? iconic minimalism.

Purpose:

SLA_GERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U). The page’s exact text is The norm is used. β€” double space, missing norm name, not my business to fill in 🫠. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix A could be poor. This also means that the solution X, estimated condition numbers, and error bounds could be unreliable. same warning, same energy: this matters.

Parameters:

  • N β€” N is INTEGER. The number of linear equations, i.e., the order of the matrix A. N >= 0.
  • NCOLS β€” NCOLS is INTEGER. The number of columns of the matrix A. NCOLS >= 0.
  • A β€” A is REAL array, dimension (LDA,N). On entry, the N-by-N matrix A.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • AF β€” AF is REAL array, dimension (LDAF,N). The factors L and U from the factorization A = P*L*U as computed by SGETRF.
  • LDAF β€” LDAF is INTEGER. The leading dimension of the array AF. LDAF >= max(1,N).

Author:

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition: Definition at line 96 of file sla_gerpvgrw.f.


πŸ’› double precision function zla_gerpvgrw πŸ’›

double precision function zla_gerpvgrw (integer n, integer ncols, complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension( ldaf, * ) af, integer ldaf)

ZLA_GERPVGRW multiplies a square real matrix by a complex matrix. yes bestie, that’s the exact description, and we are not editing it.

Purpose:

ZLA_GERPVGRW computes the reciprocal pivot growth factor norm(A)/norm(U). The source text says The norm is used. β€” double space and all β€” so no invented norm type from me πŸ’…. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix A could be poor. This also means that the solution X, estimated condition numbers, and error bounds could be unreliable. that’s the caveat, and it’s staying.

Parameters:

  • N β€” N is INTEGER. The number of linear equations, i.e., the order of the matrix A. N >= 0.
  • NCOLS β€” NCOLS is INTEGER. The number of columns of the matrix A. NCOLS >= 0.
  • A β€” A is COMPLEX*16 array, dimension (LDA,N). On entry, the N-by-N matrix A.
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. LDA >= max(1,N).
  • AF β€” AF is COMPLEX*16 array, dimension (LDAF,N). The factors L and U from the factorization A = P*L*U as computed by ZGETRF.
  • LDAF β€” LDAF is INTEGER. The leading dimension of the array AF. LDAF >= max(1,N).

Author:

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.

Definition: Definition at line 98 of file zla_gerpvgrw.f.


πŸ‘‘ Author πŸ‘‘

Generated automatically by Doxygen for LAPACK from the source code.

k love u bye bestie πŸ’– β€” this page is from LAPACK, Version 3.12.0, and its page name is la_gerpvgrw(3). the footer didn’t give a date, so no fake date from me πŸ’€πŸ«Ά.

πŸ“¦ where this page comes from