SRC/dgeequb.f(3)

🌸 NAME 🌸

SRC/dgeequb.f(3) β€” okay bestie, this is the manual page for SRC/dgeequb.f, living its best life in the Library Functions Manual πŸ’…βœ¨


✨ SYNOPSIS ✨

πŸŽ€ Functions/Subroutines πŸŽ€

subroutine dgeequb (m, n, a, lda, r, c, rowcnd, colcnd, amax, info)

That’s the iconic DGEEQUB subroutine, showing up exactly like this:

subroutine dgeequb (m, n, a, lda, r, c, rowcnd, colcnd, amax, info)
    DGEEQUB

πŸ’– Function/Subroutine Documentation πŸ’–

πŸ¦‹ The dgeequb subroutine πŸ¦‹

Full signature, no cap:

subroutine dgeequb (integer m, integer n, double precision, dimension( lda,
* ) a, integer lda, double precision, dimension( * ) r, double
precision, dimension( * ) c, double precision rowcnd, double precision
colcnd, double precision amax, integer info)

This is DGEEQUB, and the whole function is giving β€œlet me balance your matrix so it behaves” energy 😌✨

🌈 Purpose 🌈

DGEEQUB computes row and column scalings intended to equilibrate an M-by-N matrix A and reduce its condition number. R returns the row scale factors and C the column scale factors, chosen to try to make the largest element in each row and column of the matrix B with elements B(i,j)=R(i)*A(i,j)*C(j) have an absolute value of at most the radix. πŸ‘‘

R(i) and C(j) are restricted to be a power of the radix between SMLNUM = smallest safe number and BIGNUM = largest safe number. Use of these scaling factors is not guaranteed to reduce the condition number of A but works well in practice. 🫢

This routine differs from DGEEQU by restricting the scaling factors to a power of the radix. Barring over- and underflow, scaling by these factors introduces no additional rounding errors. However, the scaled entries’ magnitudes are no longer approximately 1 but lie between sqrt(radix) and 1/sqrt(radix). 🧚

πŸ’œ Parameters πŸ’œ

  • M β€” M is INTEGER; the number of rows of the matrix A. M >= 0. 🌸
  • N β€” N is INTEGER; the number of columns of the matrix A. N >= 0. 🌸
  • A β€” A is DOUBLE PRECISION array, dimension (LDA,N); the M-by-N matrix whose equilibration factors are to be computed. πŸ’–
  • LDA β€” LDA is INTEGER; the leading dimension of the array A. LDA >= max(1,M). πŸŽ€
  • R β€” R is DOUBLE PRECISION array, dimension (M); if INFO = 0 or INFO > M, R contains the row scale factors for A. ✨
  • C β€” C is DOUBLE PRECISION array, dimension (N); if INFO = 0, C contains the column scale factors for A. ✨
  • ROWCND β€” ROWCND is DOUBLE PRECISION; if INFO = 0 or INFO > M, ROWCND contains the ratio of the smallest R(i) to the largest R(i). If ROWCND >= 0.1 and AMAX is neither too large nor too small, it is not worth scaling by R. πŸ’…
  • COLCND β€” COLCND is DOUBLE PRECISION; if INFO = 0, COLCND contains the ratio of the smallest C(i) to the largest C(i). If COLCND >= 0.1, it is not worth scaling by C. πŸ’…
  • AMAX β€” AMAX is DOUBLE PRECISION; absolute value of largest matrix element. If AMAX is very close to overflow or very close to underflow, the matrix should be scaled. πŸ”₯
  • INFO β€” INFO is INTEGER; = 0: successful exit; < 0: if INFO = -i, the i-th argument had an illegal value; > 0: if INFO = i, and i is <= M: the i-th row of A is exactly zero; > M: the (i-M)-th column of A is exactly zero. πŸ’€

πŸ‘‘ Author πŸ‘‘

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

Definition at line 144 of file dgeequb.f. πŸ¦‹


🫢 Author 🫢

Generated automatically by Doxygen for LAPACK from the source code. πŸ’–

Cute little sign-off bestie: this is LAPACK Version 3.12.0 energy, and that’s the whole page β€” mwah πŸ’‹βœ¨πŸŒΈ

πŸ“¦ where this page comes from