TESTING/EIG/slsets.f(3)

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

πŸ’… TESTING/EIG/slsets.f β€” aka the slsets glow-up ✨

okay bestie, welcome to the manual page for TESTING/EIG/slsets.f, from the LAPACK Library Functions Manual. this is the test-driver page for SLSETS, and honestly it's giving "unsung hero of the test suite" energy πŸŽ€


✨ SYNOPSIS ✨

🫢 Functions/Subroutines

  • subroutine slsets (m, p, n, a, af, lda, b, bf, ldb, c, cf, d, df, x, work, lwork, rwork, result) β€” SLSETS

🌸 Function/Subroutine Documentation 🌸

subroutine slsets (integer m, integer p, integer n, real, dimension( lda, * ) a, real, dimension( lda, * ) af, integer lda, real, dimension( ldb, * ) b, real, dimension( ldb, * ) bf, integer ldb, real, dimension( * ) c, real, dimension( * ) cf, real, dimension( * ) d, real, dimension( * ) df, real, dimension( * ) x, real, dimension( lwork ) work, integer lwork, real, dimension( * ) rwork, real, dimension( 2 ) result)

SLSETS πŸ‘‘

Purpose: 🎯

!> β€” SLSETS tests SGGLSE - a subroutine for solving linear equality constrained least square problem (LSE).

like, that's literally the whole job. it's the vibe check for SGGLSE, the solver for the linear equality constrained least square problem (LSE). it does not do the solving, it does the testing. main character energy πŸ’…


πŸ’– Parameters πŸ’–

  • M β€” M is INTEGER, and it's the number of rows of the matrix A. constraint: M >= 0. no negatives, periodt 🚫
  • P β€” P is INTEGER, the number of rows of the matrix B. P >= 0. keep it non-negative bestie πŸ™
  • N β€” N is INTEGER, the number of columns of the matrices A and B. N >= 0. again, zero or up πŸ’―
  • A β€” A is REAL array, dimension (LDA,N). it's the M-by-N matrix A. iconic ✨
  • AF β€” AF is REAL array, dimension (LDA,N). that's it, that's the whole description 🫢
  • LDA β€” LDA is INTEGER, the leading dimension of the arrays A, AF, Q and R. requirement: LDA >= max(M,N). yes it has to cover Q and R too, don't ask, it's a whole thing 😌
  • B β€” B is REAL array, dimension (LDB,N). and the original really does call it "the P-by-N matrix A" β€” not a typo we're allowed to fix, so we're passing it through untouched, fr fr πŸ’€ (it's the B matrix, live with it)
  • BF β€” BF is REAL array, dimension (LDB,N). short and sweet 🌸
  • LDB β€” LDB is INTEGER, the leading dimension of the arrays B, BF, V and S. requirement: LDB >= max(P,N). same deal as LDA, but for the B squad πŸ‘‘
  • C β€” C is REAL array, dimension( M ), and it's the vector C in the LSE problem. cute πŸ’œ
  • CF β€” CF is REAL array, dimension( M ). nothing more to say πŸŽ€
  • D β€” D is REAL array, dimension( P ), the vector D in the LSE problem. matching set with C πŸ“
  • DF β€” DF is REAL array, dimension( P ). slay 🌈
  • X β€” X is REAL array, dimension( N ), the solution vector X in the LSE problem. the moment we've all been waiting for ⭐
  • WORK β€” WORK is REAL array, dimension (LWORK). workspace, obviously 🧚
  • LWORK β€” LWORK is INTEGER, the dimension of the array WORK. size matters (for the array) πŸ’…
  • RWORK β€” RWORK is REAL array, dimension (M). real workspace, doing real work πŸ”₯
  • RESULT β€” RESULT is REAL array, dimension (2), and these are the test ratios, the whole reason we're here. no cap:
    • RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS
    • RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS

πŸ‘‘ Author πŸ‘‘

  • Univ. of Tennessee
  • Univ. of California Berkeley
  • Univ. of Colorado Denver
  • NAG Ltd.
Definition at line 153 of file slsets.f. πŸ“

πŸ¦‹ Author πŸ¦‹

Generated automatically by Doxygen for LAPACK from the source code. (yes, a robot wrote the page about the test routine β€” very meta, we love that for us πŸ€–)


and that's the whole page bestie, every option, every array, every constraint, nothing skipped πŸ’– this little gem ships with LAPACK, Version 3.12.0, and the page itself is dated TESTING/EIG/slsets.f(3). go forth and test those least squares βœ¨πŸŽ€πŸ«Ά

πŸ“¦ where this page comes from