TESTING/EIG/zlsets.f(3)

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

πŸ¦‹ TESTING/EIG/zlsets.f β€” from the LAPACK Library Functions Manual, bestie ✨

Okay so real talk, this page is from the TESTING/EIG corner of LAPACK, and it's all about one little test subroutine named zlsets. Let's get into it πŸ’…


✨ NAME ✨

TESTING/EIG/zlsets.f β€” that's the file, that's the vibe, that's the whole main character πŸŽ€


🌸 SYNOPSIS 🌸

Functions/Subroutines

  • subroutine zlsets (m, p, n, a, af, lda, b, bf, ldb, c, cf, d, df, x, work, lwork, rwork, result) β€” literally ZLSETS, the icon herself πŸ‘‘

πŸ’œ Function/Subroutine Documentation πŸ’œ

subroutine zlsets πŸ™ˆ

Full signature, copied exactly because we do not play with argument order:

subroutine zlsets (integer m, integer p, integer n, complex*16, dimension(
    lda, * ) a, complex*16, dimension( lda, * ) af, integer lda, complex*16,
    dimension( ldb, * ) b, complex*16, dimension( ldb, * ) bf, integer ldb,
    complex*16, dimension( * ) c, complex*16, dimension( * ) cf, complex*16,
    dimension( * ) d, complex*16, dimension( * ) df, complex*16, dimension(
    * ) x, complex*16, dimension( lwork ) work, integer lwork, double
    precision, dimension( * ) rwork, double precision, dimension( 2 )
    result)

ZLSETS. That's it. That's the name 🫢

🧚 Purpose

ZLSETS tests ZGGLSE β€” a subroutine for solving linear equality constrained least square problem (LSE).

So like, it's the tester. ZGGLSE does the actual solving, ZLSETS is the friend who checks its work. No cap πŸ’―

🌈 Parameters

  • M
M is INTEGER
The number of rows of the matrix A.  M >= 0.
  • P
P is INTEGER
The number of rows of the matrix B.  P >= 0.
  • N
N is INTEGER
The number of columns of the matrices A and B.  N >= 0.
  • A
A is COMPLEX*16 array, dimension (LDA,N)
The M-by-N matrix A.
  • AF
AF is COMPLEX*16 array, dimension (LDA,N)

(yes bestie, that's the whole description, don't come for me πŸ™ˆ)

  • LDA
LDA is INTEGER
The leading dimension of the arrays A, AF, Q and R.
LDA >= max(M,N).
  • B
B is COMPLEX*16 array, dimension (LDB,N)
The P-by-N matrix A.

⚠️ okay so the source literally says "matrix A" here even though it's describing B β€” I'm just telling you what it says, don't shoot the messenger 😭

  • BF
BF is COMPLEX*16 array, dimension (LDB,N)
  • LDB
LDB is INTEGER
The leading dimension of the arrays B, BF, V and S.
LDB >= max(P,N).
  • C
C is COMPLEX*16 array, dimension( M )
the vector C in the LSE problem.
  • CF
CF is COMPLEX*16 array, dimension( M )
  • D
D is COMPLEX*16 array, dimension( P )
the vector D in the LSE problem.
  • DF
DF is COMPLEX*16 array, dimension( P )
  • X
X is COMPLEX*16 array, dimension( N )
solution vector X in the LSE problem.
  • WORK
WORK is COMPLEX*16 array, dimension (LWORK)
  • LWORK
LWORK is INTEGER
The dimension of the array WORK.
  • RWORK
RWORK is DOUBLE PRECISION array, dimension (M)
  • RESULT
RESULT is DOUBLE PRECISION array, dimension (2)
The test ratios:
  RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS
  RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS

These are the receipts 🧾✨ Two ratios, two vibe checks, that's the whole test.


πŸ‘‘ Author

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

Definition at line 149 of file zlsets.f. πŸ“


⭐ Author (again, but automated this time)

Generated automatically by Doxygen for LAPACK from the source code. πŸ€– (the robots wrote this part, not me)


okay that's the whole page, hope it slayed for you πŸ’– now go test some least squares problems, bestie, you got this πŸ¦‹

LAPACK β€” Version 3.12.0 β€” TESTING/EIG/zlsets.f(3) πŸŽ€ bye bye, mwah πŸ’‹

πŸ“¦ where this page comes from