/home/abui...yrcond_c.f(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

πŸ¦‹ zla_syrcond_c.f(3) β€” the glow-up edition

okay so bestie, gather round πŸ’– this one lives in the LAPACK Library Functions Manual, and its whole government name is literally the path /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zla_syrcond_c.f β€” yes that's the actual title, no I'm not joking, they really said "the filepath IS the name" and honestly? iconic. πŸŽ€


✨ NAME ✨

/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/zla_syrcond_c.f β€” that's it, that's the name, she's a whole filesystem path and she's thriving πŸ’…


🌸 SYNOPSIS 🌸

Functions/Subroutines

double precision function ZLA_SYRCOND_C (uplo, n, a, lda, af, ldaf,
    ipiv, c, capply, info, work, rwork)

ZLA_SYRCOND_C computes the infinity norm condition number of op(A)*inv(diag(c)) for symmetric indefinite matrices. that's the whole vibe fr fr 🌈


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

double precision function ZLA_SYRCOND_C (character uplo, integer n,
    complex*16, dimension( lda, * ) a, integer lda, complex*16, dimension(
    ldaf, * ) af, integer ldaf, integer, dimension( * ) ipiv, double
    precision, dimension( * ) c, logical capply, integer info, complex*16,
    dimension( * ) work, double precision, dimension( * ) rwork)

ZLA_SYRCOND_C computes the infinity norm condition number of op(A)*inv(diag(c)) for symmetric indefinite matrices. slay πŸ’…

Purpose:

!>
!>    ZLA_SYRCOND_C Computes the infinity norm condition number of
!>    op(A) * inv(diag(C)) where C is a DOUBLE PRECISION vector.
!>

literally that's the entire purpose statement, she's concise and she knows it ✨

Parameters

  • UPLO β€” UPLO is CHARACTER*1, and it's giving "which triangle are we working with" energy:
    • = 'U': Upper triangle of A is stored;
    • = 'L': Lower triangle of A is stored.
  • N β€” N is INTEGER. The number of linear equations, i.e. the order of the matrix A. and the rules are N >= 0 (no negativity allowed bestie 🚫).
  • A β€” A is COMPLEX*16 array, dimension (LDA,N). On entry, the N-by-N matrix A. main character matrix energy πŸ‘‘
  • LDA β€” LDA is INTEGER. The leading dimension of the array A. She must satisfy LDA >= max(1,N). periodt.
  • AF β€” AF is COMPLEX*16 array, dimension (LDAF,N). The block diagonal matrix D and the multipliers used to obtain the factor U or L as computed by ZSYTRF. it's giving "previously on ZSYTRF…" πŸ“
  • LDAF β€” LDAF is INTEGER. The leading dimension of the array AF, and it better hold up to LDAF >= max(1,N) πŸ’€
  • IPIV β€” IPIV is INTEGER array, dimension (N). Details of the interchanges and the block structure of D as determined by ZSYTRF. receipts, basically 🧾
  • C β€” C is DOUBLE PRECISION array, dimension (N). The vector C in the formula op(A) * inv(diag(C)). that's her, that's the C in question πŸ’–
  • CAPPLY β€” CAPPLY is LOGICAL. If .TRUE. then access the vector C in the formula above. if false she simply does not look, respect the boundaries 🫢
  • INFO β€” INFO is INTEGER:
    • = 0: Successful exit. πŸŽ‰
    • i > 0: The ith argument is invalid. 😭 (yes, i β€” that's literally what it says, don't come for me)
  • WORK β€” WORK is COMPLEX*16 array, dimension (2*N). Workspace. a humble little scratchpad, 2N of them 🌸
  • RWORK β€” RWORK is DOUBLE PRECISION array, dimension (N). Workspace. the double precision sibling of WORK, also just here to help ✨

πŸ‘‘ Author πŸ‘‘

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

the whole academic squad showed up for this one, ate and left no crumbs πŸ”₯

Definition at line 137 of file zla_syrcond_c.f. iykyk πŸ“


🌟 Author 🌟

Generated automatically by Doxygen for LAPACK from the source code. not me being auto-generated by Doxygen 😭 she's literally built different (by a doc generator).


πŸ’€ quick vibe check: this page is LAPACK, Version 3.12.0, dated /home/abui...yrcond_c.f(3) β€” and that's the whole manual page bestie, no cap, every flag accounted for πŸŽ€πŸ’–βœ¨πŸ¦‹πŸŒΈπŸ’…πŸ«Ά
πŸ“¦ where this page comes from