CLARGV(3)

🌸 CLARGV(3) — the clargv.f page, bestie edition 🌸

okok so this is the manual page for /home/abui...RC/clargv.f(3) from the Library Functions Manual — yes the header path is abbreviated with ..., that's just how it's printed, don't come for me 💅. It's a LAPACK thing, it lives at /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/clargv.f, and we're gonna get into it.

---

✨ NAME ✨

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/clargv.f

that's the file, that's the whole name section, it's giving "my name is my address" and honestly? iconic 🎀

---

✨ SYNOPSIS ✨

Functions/Subroutines 🦋

subroutine CLARGV (n, x, incx, y, incy, c, incc)

CLARGV generates a vector of plane rotations with real cosines and complex sines. periodt.

---

✨ Function/Subroutine Documentation ✨

subroutine CLARGV (integer n, complex, dimension( * ) x, integer incx,
    complex, dimension( * ) y, integer incy, real, dimension( * ) c, integer
    incc)

CLARGV generates a vector of plane rotations with real cosines and complex sines. (yes I said it twice, it's that serious 🔥)

💜 Purpose

!>
!> CLARGV generates a vector of complex plane rotations with real
!> cosines, determined by elements of the complex vectors x and y.
!> For i = 1,2,...,n
!>
!>    (        c(i)   s(i) ) ( x(i) ) = ( r(i) )
!>    ( -conjg(s(i))  c(i) ) ( y(i) ) = (   0  )
!>
!>    where c(i)**2 + ABS(s(i))**2 = 1
!>
!> The following conventions are used (these are the same as in CLARTG,
!> but differ from the BLAS1 routine CROTG):
!>    If y(i)=0, then c(i)=1 and s(i)=0.
!>    If x(i)=0, then c(i)=0 and s(i) is chosen so that r(i) is real.
!>

so like, it builds you a whole vector of complex plane rotations with real cosines, pulled straight from the elements of the complex vectors x and y, for i = 1,2,...,n. the math is literally right there ⬆️ — c(i)**2 + ABS(s(i))**2 = 1, no cap. and the conventions? same as CLARTG but different from the BLAS1 routine CROTG — iykyk, don't mix them up bestie 🙈

🎀 Parameters

• N — N is INTEGER. The number of plane rotations to be generated. that's how many we're making, bestie.

!>          N is INTEGER
!>          The number of plane rotations to be generated.
!>

• X — X is COMPLEX array, dimension (1+(N-1)*INCX). on entry, the vector x; on exit, x(i) is overwritten by r(i), for i = 1,...,n. so she goes in as one thing and comes out as another, main character transformation arc ✨

!>          X is COMPLEX array, dimension (1+(N-1)*INCX)
!>          On entry, the vector x.
!>          On exit, x(i) is overwritten by r(i), for i = 1,...,n.
!>

• INCX — INCX is INTEGER. The increment between elements of X. INCX > 0. strictly positive, no zero, no negatives, we don't do that here.

!>          INCX is INTEGER
!>          The increment between elements of X. INCX > 0.
!>

• Y — Y is COMPLEX array, dimension (1+(N-1)*INCY). on entry, the vector y; on exit, the sines of the plane rotations. 🦋

!>          Y is COMPLEX array, dimension (1+(N-1)*INCY)
!>          On entry, the vector y.
!>          On exit, the sines of the plane rotations.
!>

• INCY — INCY is INTEGER. The increment between elements of Y. INCY > 0. again, positive only, tyvm.

!>          INCY is INTEGER
!>          The increment between elements of Y. INCY > 0.
!>

• C — C is REAL array, dimension (1+(N-1)*INCC). The cosines of the plane rotations. real ones only, that's the whole point 💖

!>          C is REAL array, dimension (1+(N-1)*INCC)
!>          The cosines of the plane rotations.
!>

• INCC — INCC is INTEGER. The increment between elements of C. INCC > 0. positive. always. 🌈

!>          INCC is INTEGER
!>          The increment between elements of C. INCC > 0.
!>

👑 Author

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.

four whole institutions, they really said "team effort" and honestly? we love a collab 💜

🧚 Further Details

!>
!>  6-6-96 - Modified with a new algorithm by W. Kahan and J. Demmel
!>
!>  This version has a few statements commented out for thread safety
!>  (machine parameters are computed on each entry). 10 feb 03, SJH.
!>

so the lore: 6-6-96 — modified with a new algorithm by W. Kahan and J. Demmel 🔥 and this version has a few statements commented out for thread safety, because the machine parameters are computed on each entry. dated 10 feb 03, SJH. respect the history fr fr.

---

📌 Definition at line 121 of file clargv.f

that's literally where she lives. line 121, file clargv.f. go look, she's there 🫶

---

🎀 Author

Generated automatically by Doxygen for LAPACK from the source code. not a human, a whole robot, and it ate 💅

---

🌸 ok that's the page!! sourced from LAPACK, Version 3.12.0, and the footer path /home/abui...RC/clargv.f(3) — abbreviated with the ... exactly like the original prints it, mwah 💖 thanks for reading bestie, go generate some plane rotations 🦋✨