CTRMM(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

πŸ’– CTRMM(3) πŸ’–

okay bestie so this is a page from the Library Functions Manual (the ctrmm.f(3) one, from /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/BLAS/SRC/ctrmm.f β€” yes that's the whole entire path, no I'm not shortening it, it's part of the lore πŸ’…)


✨ SYNOPSIS ✨

Functions / Subroutines

subroutine CTRMM (side, uplo, transa, diag, m, n, alpha, a, lda, b, ldb)

CTRMM 🫢


πŸŽ€ Function / Subroutine Documentation πŸŽ€

subroutine CTRMM (character side, character uplo, character transa,
    character diag, integer m, integer n, complex alpha, complex,
    dimension(lda,*) a, integer lda, complex, dimension(ldb,*) b, integer
    ldb)

CTRMM ✨

πŸ’œ Purpose πŸ’œ

bestie, CTRMM performs one of the matrix-matrix operations:

B := alpha*op( A )*B,   or   B := alpha*B*op( A )

where alpha is a scalar, B is an m by n matrix, A is a unit, or non-unit, upper or lower triangular matrix and op( A ) is one of:

op( A ) = A   or   op( A ) = A**T   or   op( A ) = A**H.

like, that's it, that's the whole vibe πŸ”₯


🌸 Parameters 🌸

  • SIDE β€” SIDE is CHARACTER*1. on entry, SIDE specifies whether op( A ) multiplies B from the left or right, as follows:
    • SIDE = 'L' or 'l' β†’ B := alpha*op( A )*B.
    • SIDE = 'R' or 'r' β†’ B := alpha*B*op( A ).
  • UPLO β€” UPLO is CHARACTER*1. on entry, UPLO specifies whether the matrix A is an upper or lower triangular matrix, as follows:
    • UPLO = 'U' or 'u' β†’ A is an upper triangular matrix.
    • UPLO = 'L' or 'l' β†’ A is a lower triangular matrix.
  • TRANSA β€” TRANSA is CHARACTER*1. on entry, TRANSA specifies the form of op( A ) to be used in the matrix multiplication, as follows:
    • TRANSA = 'N' or 'n' β†’ op( A ) = A.
    • TRANSA = 'T' or 't' β†’ op( A ) = A**T.
    • TRANSA = 'C' or 'c' β†’ op( A ) = A**H.
  • DIAG β€” DIAG is CHARACTER*1. on entry, DIAG specifies whether or not A is unit triangular, as follows:
    • DIAG = 'U' or 'u' β†’ A is assumed to be unit triangular.
    • DIAG = 'N' or 'n' β†’ A is not assumed to be unit triangular.
  • M β€” M is INTEGER. on entry, M specifies the number of rows of B. no cap, M must be at least zero 🫢
  • N β€” N is INTEGER. on entry, N specifies the number of columns of B. N must be at least zero ✨
  • ALPHA β€” ALPHA is COMPLEX. on entry, ALPHA specifies the scalar alpha. iconic detail: when alpha is zero then A is not referenced and B need not be set before entry πŸ’€ (free real estate!)
  • A β€” A is COMPLEX array, dimension ( LDA, k ), where k is m when SIDE = 'L' or 'l' and is n when SIDE = 'R' or 'r'.
    • before entry with UPLO = 'U' or 'u', the leading k by k upper triangular part of the array A must contain the upper triangular matrix, and the strictly lower triangular part of A is not referenced.
    • before entry with UPLO = 'L' or 'l', the leading k by k lower triangular part of the array A must contain the lower triangular matrix, and the strictly upper triangular part of A is not referenced.
    • note that when DIAG = 'U' or 'u', the diagonal elements of A are not referenced either, but are assumed to be unity πŸ‘‘
  • LDA β€” LDA is INTEGER. on entry, LDA specifies the first dimension of A as declared in the calling (sub) program. when SIDE = 'L' or 'l' then LDA must be at least max( 1, m ); when SIDE = 'R' or 'r' then LDA must be at least max( 1, n ).
  • B β€” B is COMPLEX array, dimension ( LDB, N ). before entry, the leading m by n part of the array B must contain the matrix B, and on exit it is overwritten by the transformed matrix 😭 (she's a main character, she changes)
  • LDB β€” LDB is INTEGER. on entry, LDB specifies the first dimension of B as declared in the calling (sub) program. LDB must be at least max( 1, m ).

πŸ‘‘ Author πŸ‘‘

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

πŸ¦‹ Further Details: πŸ¦‹

Level 3 Blas routine. ✨

-- Written on 8-February-1989.
   Jack Dongarra, Argonne National Laboratory.
   Iain Duff, AERE Harwell.
   Jeremy Du Croz, Numerical Algorithms Group Ltd.
   Sven Hammarling, Numerical Algorithms Group Ltd.
legend behaviour honestly, 1989 and still slaying πŸŽ€

Definition at line 176 of file ctrmm.f.


πŸ’« Author πŸ’«

Generated automatically by Doxygen for LAPACK from the source code.


and that's the whole page bestie!! this gorgeous thing is from LAPACK, Version 3.12.0 β€” auto-generated by Doxygen for LAPACK straight from the source code, path and all (/home/abui...SRC/ctrmm.f(3)), hope you had the best time reading it, mwah πŸ’–πŸ’…βœ¨

πŸ“¦ where this page comes from