TESTING/EIG/cglmts.f(3)

πŸ“¦
version 3.12.1 Β· 2 versions
, in arch rolling

okay bestie, this is TESTING/EIG/cglmts.f(3) from the Library Functions Manual β€” the whole page is about the cglmts subroutine, and it's giving β€œtest routine for CGGGLM” energy. periodt. 🫢✨

πŸ’– NAME πŸ’–

TESTING/EIG/cglmts.f

✨ SYNOPSIS ✨

Functions/Subroutines

       subroutine cglmts (n, m, p, a, af, lda, b, bf, ldb, d, df, x, u, work,
           lwork, rwork, result)

CGLMTS

🌸 Function/Subroutine Documentation 🌸

   subroutine cglmts (integer n, integer m, integer p, complex, dimension( lda,
       * ) a, complex, dimension( lda, * ) af, integer lda, complex, dimension(
       ldb, * ) b, complex, dimension( ldb, * ) bf, integer ldb, complex,
       dimension( * ) d, complex, dimension( * ) df, complex, dimension( * ) x,
       complex, dimension( * ) u, complex, dimension( lwork ) work, integer
       lwork, real, dimension( * ) rwork, real result)

CGLMTS

Purpose 🎯

CGLMTS tests CGGGLM - a subroutine for solving the generalized linear model problem. That's the whole purpose, no cap. πŸ’…

Parameters πŸ’…

okay so here's the parameter tea, in order, and yes I'm keeping every constraint exactly as written:

  • N β€” N is INTEGER. The number of rows of the matrices A and B. Constraint: N >= 0.
  • M β€” M is INTEGER. The number of columns of the matrix A. Constraint: M >= 0.
  • P β€” P is INTEGER. The number of columns of the matrix B. Constraint: P >= 0.
  • A β€” A is COMPLEX array, dimension (LDA,M). The N-by-M matrix A.
  • AF β€” AF is COMPLEX array, dimension (LDA,M). That's all the page says, bestie.
  • LDA β€” LDA is INTEGER. The leading dimension of the arrays A, AF. Constraint: LDA >= max(M,N).
  • B β€” B is COMPLEX array, dimension (LDB,P). The N-by-P matrix A.
yep, the B entry literally says β€œThe N-by-P matrix A.” β€” I'm not editing it, because the rule is keep every detail. πŸ™ˆ
  • BF β€” BF is COMPLEX array, dimension (LDB,P). Nothing extra listed.
  • LDB β€” LDB is INTEGER. The leading dimension of the arrays B, BF. Constraint: LDB >= max(P,N).
  • D β€” D is COMPLEX array, dimension ( N ). On input, the left hand side of the GLM.
  • DF β€” DF is COMPLEX array, dimension ( N ). That's all the page gives.
  • X β€” X is COMPLEX array, dimension ( M ). solution vector X in the GLM problem.
  • U β€” U is COMPLEX array, dimension ( P ). solution vector U in the GLM problem.
  • WORK β€” WORK is COMPLEX array, dimension (LWORK). No extra lore.
  • LWORK β€” LWORK is INTEGER. The dimension of the array WORK.
  • RWORK β€” RWORK is REAL array, dimension (M). That's the whole vibe.
  • RESULT β€” RESULT is REAL. The test ratio:
                           norm( d - A*x - B*u )
            RESULT = -----------------------------------------
                     (norm(A)+norm(B))*(norm(x)+norm(u))*EPS

Author πŸ‘‘

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

Definition at line 148 of file cglmts.f.

Author 🌈

Generated automatically by Doxygen for LAPACK from the source code.


mwah πŸ’– that's the whole page, bestie β€” signed off from LAPACK Version 3.12.0, page TESTING/EIG/cglmts.f(3). No date listed, so I'm not inventing one. πŸŽ€βœ¨

πŸ“¦ where this page comes from