la_geamv(3)

πŸ’… la_geamv(3) β€” the group-chat guide πŸ’…

okay so bestie, welcome to la_geamv(3) from the Library Functions Manual. This is the one about matrix-vector multiply with |A| * |x|, general flavored. Four routines, all doing the same iconic thing in different precisions. Let's get into it 🫢


✨ NAME ✨

la_geamv β€” la_geamv: matrix-vector multiply |A| * |x|, general. that's the whole vibe. absolute values everywhere, no cap.


πŸ¦‹ SYNOPSIS πŸ¦‹

🌈 Functions 🌈

  • subroutine cla_geamv (trans, m, n, alpha, a, lda, x, incx, beta, y, incy) β€” CLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. the complex one πŸ’œ
  • subroutine dla_geamv (trans, m, n, alpha, a, lda, x, incx, beta, y, incy) β€” DLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. the double precision one ✨
  • subroutine sla_geamv (trans, m, n, alpha, a, lda, x, incx, beta, y, incy) β€” SLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. the real single precision one 🌸
  • subroutine zla_geamv (trans, m, n, alpha, a, lda, x, incx, beta, y, incy) β€” ZLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. the double complex one πŸ‘‘

like… same energy, different types. pick your flavor πŸ“


🌟 Detailed Description 🌟

(that's it. that's the section. the real tea is all down below πŸ‘‡)


πŸ”₯ Function Documentation πŸ”₯

πŸ’… subroutine cla_geamv πŸ’…

subroutine cla_geamv (integer trans, integer m, integer n, real alpha,
    complex, dimension( lda, * ) a, integer lda, complex, dimension( * ) x,
    integer incx, real beta, real, dimension( * ) y, integer incy)

CLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. periodt.

πŸŽ€ Purpose πŸŽ€

lowkey the whole point of this function, straight from the source:

!>
!> CLA_GEAMV  performs one of the matrix-vector operations
!>
!>         y := alpha*abs(A)*abs(x) + beta*abs(y),
!>    or   y := alpha*abs(A)**T*abs(x) + beta*abs(y),
!>
!> where alpha and beta are scalars, x and y are vectors and A is an
!> m by n matrix.
!>
!> This function is primarily used in calculating error bounds.
!> To protect against underflow during evaluation, components in
!> the resulting vector are perturbed away from zero by (N+1)
!> times the underflow threshold.  To prevent unnecessarily large
!> errors for block-structure embedded in general matrices,
!>  zero components are not perturbed.  A zero
!> entry is considered  if all multiplications involved
!> in computing that entry have at least one zero multiplicand.
!>

so basically: it's for error bounds 🫢 and it nudges tiny components away from zero by (N+1) times the underflow threshold so underflow doesn't wreck the evaluation. but zero entries stay zero β€” a zero entry counts as zero if every multiplication that went into computing it had at least one zero multiplicand. it's giving "protect the vibe, not the zeros" πŸ’€

🌸 Parameters 🌸

  • TRANS β€” TRANS is INTEGER. on entry, TRANS specifies the operation to be performed, like so:
BLAS_NO_TRANS      y := alpha*abs(A)*abs(x) + beta*abs(y)
BLAS_TRANS         y := alpha*abs(A**T)*abs(x) + beta*abs(y)
BLAS_CONJ_TRANS    y := alpha*abs(A**T)*abs(x) + beta*abs(y)

unchanged on exit. yes bestie, BLAS_TRANS and BLAS_CONJ_TRANS give you the same line here β€” that's literally what the page says, don't come for me πŸ™ˆ

  • M β€” M is INTEGER. on entry, M specifies the number of rows of the matrix A. M must be at least zero. unchanged on exit.
  • N β€” N is INTEGER. on entry, N specifies the number of columns of the matrix A. N must be at least zero. unchanged on exit.
  • ALPHA β€” ALPHA is REAL. on entry, ALPHA specifies the scalar alpha. unchanged on exit.
  • A β€” A is COMPLEX array, dimension (LDA,n). before entry, the leading m by n part of the array A must contain the matrix of coefficients. unchanged on exit.
  • LDA β€” LDA is INTEGER. on entry, LDA specifies the first dimension of A as declared in the calling (sub) program. LDA must be at least max( 1, m ). unchanged on exit.
  • X β€” X is COMPLEX array, dimension ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' and at least ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. before entry, the incremented array X must contain the vector x. unchanged on exit.
  • INCX β€” INCX is INTEGER. on entry, INCX specifies the increment for the elements of X. INCX must not be zero. unchanged on exit. 🚫 no zero increments, that's the rule.
  • BETA β€” BETA is REAL. on entry, BETA specifies the scalar beta. when BETA is supplied as zero then Y need not be set on input. unchanged on exit. (free pass when it's zero, we love efficiency ✨)
  • Y β€” Y is REAL array, dimension ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' and at least ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. before entry with BETA non-zero, the incremented array Y must contain the vector y. on exit, Y is overwritten by the updated vector y. if either m or n is zero, then Y not referenced and the function performs a quick return. πŸƒβ€β™€οΈπŸ’¨
  • INCY β€” INCY is INTEGER. on entry, INCY specifies the increment for the elements of Y. INCY must not be zero. unchanged on exit.
Level 2 Blas routine. that's the whole note, and honestly? iconic.

πŸ‘‘ Author πŸ‘‘

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

⭐ Definition ⭐

Definition at line 175 of file cla_geamv.f.


πŸ¦‹ subroutine dla_geamv πŸ¦‹

subroutine dla_geamv (integer trans, integer m, integer n, double precision
    alpha, double precision, dimension( lda, * ) a, integer lda, double
    precision, dimension( * ) x, integer incx, double precision beta, double
    precision, dimension( * ) y, integer incy)

DLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. same assignment, double precision era πŸ’œ

πŸŽ€ Purpose πŸŽ€

!>
!> DLA_GEAMV  performs one of the matrix-vector operations
!>
!>         y := alpha*abs(A)*abs(x) + beta*abs(y),
!>    or   y := alpha*abs(A)**T*abs(x) + beta*abs(y),
!>
!> where alpha and beta are scalars, x and y are vectors and A is an
!> m by n matrix.
!>
!> This function is primarily used in calculating error bounds.
!> To protect against underflow during evaluation, components in
!> the resulting vector are perturbed away from zero by (N+1)
!> times the underflow threshold.  To prevent unnecessarily large
!> errors for block-structure embedded in general matrices,
!>  zero components are not perturbed.  A zero
!> entry is considered  if all multiplications involved
!> in computing that entry have at least one zero multiplicand.
!>

identical purpose, identical nudge by (N+1) times the underflow threshold, identical "zeros stay zero" energy. it's consistent, and we respect that πŸ’…

🌸 Parameters 🌸

  • TRANS β€” TRANS is INTEGER. on entry, TRANS specifies the operation to be performed as follows:
BLAS_NO_TRANS      y := alpha*abs(A)*abs(x) + beta*abs(y)
BLAS_TRANS         y := alpha*abs(A**T)*abs(x) + beta*abs(y)
BLAS_CONJ_TRANS    y := alpha*abs(A**T)*abs(x) + beta*abs(y)

unchanged on exit.

  • M β€” M is INTEGER. on entry, M specifies the number of rows of the matrix A. M must be at least zero. unchanged on exit.
  • N β€” N is INTEGER. on entry, N specifies the number of columns of the matrix A. N must be at least zero. unchanged on exit.
  • ALPHA β€” ALPHA is DOUBLE PRECISION. on entry, ALPHA specifies the scalar alpha. unchanged on exit.
  • A β€” A is DOUBLE PRECISION array, dimension ( LDA, n ). before entry, the leading m by n part of the array A must contain the matrix of coefficients. unchanged on exit.
  • LDA β€” LDA is INTEGER. on entry, LDA specifies the first dimension of A as declared in the calling (sub) program. LDA must be at least max( 1, m ). unchanged on exit.
  • X β€” X is DOUBLE PRECISION array, dimension ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' and at least ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. before entry, the incremented array X must contain the vector x. unchanged on exit.
  • INCX β€” INCX is INTEGER. on entry, INCX specifies the increment for the elements of X. INCX must not be zero. unchanged on exit.
  • BETA β€” BETA is DOUBLE PRECISION. on entry, BETA specifies the scalar beta. when BETA is supplied as zero then Y need not be set on input. unchanged on exit.
  • Y β€” Y is DOUBLE PRECISION array, dimension at least ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' and at least ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. before entry with BETA non-zero, the incremented array Y must contain the vector y. on exit, Y is overwritten by the updated vector y. if either m or n is zero, then Y not referenced and the function performs a quick return. πŸ™ˆ
  • INCY β€” INCY is INTEGER. on entry, INCY specifies the increment for the elements of Y. INCY must not be zero. unchanged on exit.
Level 2 Blas routine. still iconic, still true.

πŸ‘‘ Author πŸ‘‘

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

⭐ Definition ⭐

Definition at line 174 of file dla_geamv.f.


🌈 subroutine sla_geamv 🌈

subroutine sla_geamv (integer trans, integer m, integer n, real alpha, real,
    dimension( lda, * ) a, integer lda, real, dimension( * ) x, integer
    incx, real beta, real, dimension( * ) y, integer incy)

SLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. single precision bestie, real numbers only, still slaying 🌸

πŸŽ€ Purpose πŸŽ€

(the tea continues in part 2, don't go anywhere 🫢)

🌸 Parameters 🌸

okay so sla_geamv rolls with ten arguments and every single one has a whole personality β€” let's go πŸ’…

  • TRANS β€” INTEGER. on entry, this tells us which operation we're doing, and the menu is:
BLAS_NO_TRANS      y := alpha*abs(A)*abs(x) + beta*abs(y)
BLAS_TRANS         y := alpha*abs(A**T)*abs(x) + beta*abs(y)
BLAS_CONJ_TRANS    y := alpha*abs(A**T)*abs(x) + beta*abs(y)

unchanged on exit, bestie ✨

  • M β€” INTEGER. on entry it's the number of rows of the matrix A. M has to be at least zero (M >= 0, no cap πŸ₯²). unchanged on exit.
  • N β€” INTEGER. on entry it's the number of columns of the matrix A. N must be at least zero too. unchanged on exit.
  • ALPHA β€” REAL. on entry it's the scalar alpha. unchanged on exit. she's just vibing, not changing.
  • A β€” REAL array, dimension ( LDA, n ). before entry, the leading m by n part of the array A must contain the matrix of coefficients πŸ”₯. unchanged on exit.
  • LDA β€” INTEGER. on entry it's the first dimension of A as declared in the calling (sub) program. LDA must be at least max( 1, m ). unchanged on exit.
  • X β€” REAL array, dimension ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n', and at least ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. before entry, the incremented array X must contain the vector x. unchanged on exit πŸ¦‹
  • INCX β€” INTEGER. on entry it's the increment for the elements of X. INCX must not be zero β€” fr fr, do not do that 🚫. unchanged on exit.
  • BETA β€” REAL. on entry it's the scalar beta. and here's the cute part: when BETA is supplied as zero, Y doesn't even need to be set on input, she's off the hook πŸ’…. unchanged on exit.
  • Y β€” REAL array, dimension at least ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n', and at least ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. before entry with BETA non-zero, the incremented array Y must contain the vector y. on exit, Y is overwritten by the updated vector y β€” she's been through a whole transformation, periodt. and if either m or n is zero, then Y is not referenced and the function performs a quick return πŸƒβ€β™€οΈπŸ’¨
  • INCY β€” INTEGER. on entry it's the increment for the elements of Y. INCY must not be zero (same rule, no exceptions). unchanged on exit.
Level 2 Blas routine. that's the whole flex. icon behavior only πŸ‘‘

πŸ‘‘ Author πŸ‘‘

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

definition at line 174 of file sla_geamv.f. the receipts are right there 🧾


πŸ¦‹ subroutine zla_geamv πŸ¦‹

the complex edition, and honestly she ate:

subroutine zla_geamv (integer trans, integer m, integer n, double precision
    alpha, complex*16, dimension( lda, * ) a, integer lda, complex*16,
    dimension( * ) x, integer incx, double precision beta, double precision,
    dimension( * ) y, integer incy)

ZLA_GEAMV computes a matrix-vector product using a general matrix to calculate error bounds. same job, bigger numbers, more sparkle ✨

πŸ’œ Purpose πŸ’œ

okay so ZLA_GEAMV performs one of these matrix-vector operations:

y := alpha*abs(A)*abs(x) + beta*abs(y),

or

y := alpha*abs(A)**T*abs(x) + beta*abs(y),

where alpha and beta are scalars, x and y are vectors, and A is an m by n matrix.

this function is primarily used in calculating error bounds. to protect against underflow during evaluation, components in the resulting vector are perturbed away from zero by (N+1) times the underflow threshold. that's the safety net, she's got your back 🫢

to prevent unnecessarily large errors for block-structure embedded in general matrices, zero components are not perturbed. and a zero entry is considered if all multiplications involved in computing that entry have at least one zero multiplicand. iykyk β€” that's the whole rule πŸ’€

πŸŽ€ Parameters πŸŽ€

same ten besties, but now with complex energy:

  • TRANS β€” INTEGER. on entry, TRANS specifies the operation to be performed as follows:
BLAS_NO_TRANS      y := alpha*abs(A)*abs(x) + beta*abs(y)
BLAS_TRANS         y := alpha*abs(A**T)*abs(x) + beta*abs(y)
BLAS_CONJ_TRANS    y := alpha*abs(A**T)*abs(x) + beta*abs(y)

unchanged on exit.

  • M β€” INTEGER. on entry, M specifies the number of rows of the matrix A. M must be at least zero. unchanged on exit.
  • N β€” INTEGER. on entry, N specifies the number of columns of the matrix A. N must be at least zero. unchanged on exit.
  • ALPHA β€” DOUBLE PRECISION. on entry, ALPHA specifies the scalar alpha. unchanged on exit.
  • A β€” COMPLEX*16 array, dimension ( LDA, n ). before entry, the leading m by n part of the array A must contain the matrix of coefficients. unchanged on exit.
  • LDA β€” INTEGER. on entry, LDA specifies the first dimension of A as declared in the calling (sub) program. LDA must be at least max( 1, m ). unchanged on exit.
  • X β€” COMPLEX*16 array, dimension at least ( 1 + ( n - 1 )*abs( INCX ) ) when TRANS = 'N' or 'n' and at least ( 1 + ( m - 1 )*abs( INCX ) ) otherwise. before entry, the incremented array X must contain the vector x. unchanged on exit 🌈
  • INCX β€” INTEGER. on entry, INCX specifies the increment for the elements of X. INCX must not be zero. unchanged on exit.
  • BETA β€” DOUBLE PRECISION. on entry, BETA specifies the scalar beta. when BETA is supplied as zero then Y need not be set on input. unchanged on exit.
  • Y β€” DOUBLE PRECISION array, dimension ( 1 + ( m - 1 )*abs( INCY ) ) when TRANS = 'N' or 'n' and at least ( 1 + ( n - 1 )*abs( INCY ) ) otherwise. before entry with BETA non-zero, the incremented array Y must contain the vector y. on exit, Y is overwritten by the updated vector y. and if either m or n is zero, then Y is not referenced and the function performs a quick return 😴
  • INCY β€” INTEGER. on entry, INCY specifies the increment for the elements of Y. INCY must not be zero. unchanged on exit.
Level 2 Blas routine. again. consistency is the moment πŸ‘

🌟 Author 🌟

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

definition at line 175 of file zla_geamv.f. and that's the complex receipt, stamped and everything 🧾✨


🫢 Author 🫢

generated automatically by Doxygen for LAPACK from the source code. so like, a robot wrote this one, but she understood the assignment ngl πŸ€–πŸ’–


aaaand that's a wrap bestie πŸŽ€ this whole page is from LAPACK, Version 3.12.0, and it's dated la_geamv(3) β€” go forth, call your error bounds, and slay πŸ’…βœ¨πŸ”₯

πŸ“¦ where this page comes from