ZLSETS(3)
π¦ ZLSETS(3) β bestie, let's talk linear equality constrained least squares π
okay so real talk: this is the zlsets.f(3) page, straight out of the LAPACK Library Functions Manual, and it lives at that path you see above. It's a Fortran thing. It's a testing thing. It's giving "I run the vibes check on ZGGLSE" and honestly? iconic. β¨
πΈ NAME πΈ
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/TESTING/EIG/zlsets.f
like, that's the whole name. the file. that's it. she's a whole path and she owns it π
π«Ά SYNOPSIS π«Ά
Functions/Subroutines
subroutine ZLSETS (m, p, n, a, af, lda, b, bf, ldb, c, cf, d, df, x, work, lwork, rwork, result)β the one and onlyZLSETS, no cap
subroutine ZLSETS (m, p, n, a, af, lda, b, bf, ldb, c, cf, d, df, x,
work, lwork, rwork, result)
ZLSETS
π Function/Subroutine Documentation π
π subroutine ZLSETS
here's the full glow-up of the signature, literally every argument in her full fit:
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
β¨ Purpose β¨
!>!> ZLSETS tests ZGGLSE - a subroutine for solving linear equality!> constrained least square problem (LSE).!>
so she's a tester. she tests ZGGLSE, which is the subroutine that solves the linear equality constrained least square problem, aka LSE. she's the friend who double-checks your outfit before you leave the house. we stan a supportive queen π₯
π Parameters π
okay bestie, buckle up, here comes the whole cast:
Mπ
!> M is INTEGER !> The number of rows of the matrix A. M >= 0. !>
the row count of A. and she's gotta be M >= 0.
Pπ
!> P is INTEGER !> The number of rows of the matrix B. P >= 0. !>
the row count of B. P >= 0, always.
Nπ
!> N is INTEGER !> The number of columns of the matrices A and B. N >= 0. !>
the column count for both A and B. N >= 0. shared custody, love that for them.
Aπ
!> A is COMPLEX*16 array, dimension (LDA,N) !> The M-by-N matrix A. !>
the M-by-N matrix A, in all her COMPLEX*16 glory.
AFπ
!> AF is COMPLEX*16 array, dimension (LDA,N) !>
type COMPLEX*16, dimension (LDA,N). that's the whole note. no further comment, she said what she said π
LDAπ
!> LDA is INTEGER !> The leading dimension of the arrays A, AF, Q and R. !> LDA >= max(M,N). !>
the leading dimension of A, AF, Q and R. she must clear LDA >= max(M,N).
Bπ
!> B is COMPLEX*16 array, dimension (LDB,N) !> The P-by-N matrix A. !>
type COMPLEX*16, dimension (LDB,N). and yep, the source literally says "The P-by-N matrix A." β that's what it says, we're not editing it, it's part of the lore π
BFπ
!> BF is COMPLEX*16 array, dimension (LDB,N) !>
again, that's the description. COMPLEX*16, dimension (LDB,N), mic drop π€
LDBπ
!> LDB is INTEGER !> The leading dimension of the arrays B, BF, V and S. !> LDB >= max(P,N). !>
the leading dimension of B, BF, V and S. she must clear LDB >= max(P,N).
Cπ
!> C is COMPLEX*16 array, dimension( M ) !> the vector C in the LSE problem. !>
the vector C in the LSE problem. main character of the equality constraint, periodt.
CFπ
!> CF is COMPLEX*16 array, dimension( M ) !>
COMPLEX*16, dimension (M). that's the descriptor, bestie.
Dπ
!> D is COMPLEX*16 array, dimension( P ) !> the vector D in the LSE problem. !>
the vector D in the LSE problem. her moment.
DFπ
!> DF is COMPLEX*16 array, dimension( P ) !>
COMPLEX*16, dimension (P). short and sweet.
Xπ
!> X is COMPLEX*16 array, dimension( N ) !> solution vector X in the LSE problem. !>
the solution vector X in the LSE problem. THE answer. the one we were all waiting for π
WORKπ
!> WORK is COMPLEX*16 array, dimension (LWORK) !>
COMPLEX*16, dimension (LWORK). workspace, doing the invisible labour, respect.
LWORKπ
!> LWORK is INTEGER !> The dimension of the array WORK. !>
the dimension of WORK. that's the whole vibe.
RWORKπ
!> RWORK is DOUBLE PRECISION array, dimension (M) !>
DOUBLE PRECISION, dimension (M). yes, double precision. she's fancy.
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 !>
DOUBLE PRECISION, dimension (2), and she carries 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
two ratios. two vibes. one RESULT array. slay π
π Author π
the whole squad gets credit, fr fr:
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 149 of file zlsets.f.
β Author β
Generated automatically by Doxygen for LAPACK from the source code.
okay that's the page!! π¦ thanks for reading all the way to the end, you're a real one π«Ά this was LAPACK Version 3.12.0, and yeah β a robot named Doxygen wrote the sign-off, but the hype is 100% genuine πβ¨π
π¦ where this page comes from
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- opensuse-leap 16.0: lapack-man 3.12.0-160000.2.2 Β· BSD-3-Clause
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms