SRC/sstevd.f(3)
π SRC/sstevd.f β from the LAPACK Library Functions Manual, bestie π
okay so picture this: it's a Fortran file, it's called SRC/sstevd.f, and it's about to make your tridiagonal matrix very famous. let's get into it β¨
πΈ NAME πΈ
SRC/sstevd.f β the file, the moment, the legend. no cap.
π¦ SYNOPSIS π¦
Functions/Subroutines
subroutine sstevd (jobz, n, d, e, z, ldz, work, lwork, iwork, liwork,
info)
SSTEVD computes the eigenvalues and, optionally, the left and/or right eigenvectors for OTHER matrices π
π Function/Subroutine Documentation π
subroutine sstevd (character jobz, integer n, real, dimension( * ) d, real,
dimension( * ) e, real, dimension( ldz, * ) z, integer ldz, real,
dimension( * ) work, integer lwork, integer, dimension( * ) iwork,
integer liwork, integer info)
SSTEVD computes the eigenvalues and, optionally, the left and/or right eigenvectors for OTHER matrices. that's the whole assignment and she ate π₯
β¨ Purpose β¨
!>!> SSTEVD computes all eigenvalues and, optionally, eigenvectors of a!> real symmetric tridiagonal matrix. If eigenvectors are desired, it!> uses a divide and conquer algorithm.!>!>
so like β real symmetric tridiagonal matrix, all the eigenvalues, and if you want eigenvectors too she'll hook you up, and she does it with a divide and conquer algorithm, which is genuinely iconic behavior π
π Parameters π
JOBZ
!> JOBZ is CHARACTER*1!> = 'N': Compute eigenvalues only;!> = 'V': Compute eigenvalues and eigenvectors.!>
N
!> N is INTEGER!> The order of the matrix. N >= 0.!>
D
!> D is REAL array, dimension (N)!> On entry, the n diagonal elements of the tridiagonal matrix!> A.!> On exit, if INFO = 0, the eigenvalues in ascending order.!>
E
!> E is REAL array, dimension (N-1)!> On entry, the (n-1) subdiagonal elements of the tridiagonal!> matrix A, stored in elements 1 to N-1 of E.!> On exit, the contents of E are destroyed.!>
β οΈ heads up bestie βEdoes not survive this. on exit the contents ofEare destroyed. she's not sorry either π
Z
!> Z is REAL array, dimension (LDZ, N)!> If JOBZ = 'V', then if INFO = 0, Z contains the orthonormal!> eigenvectors of the matrix A, with the i-th column of Z!> holding the eigenvector associated with D(i).!> If JOBZ = 'N', then Z is not referenced.!>
π«Ά note: ifJOBZ = 'N',Zis literally not referenced. she doesn't even look at it. not one glance.
LDZ
!> LDZ is INTEGER!> The leading dimension of the array Z. LDZ >= 1, and if!> JOBZ = 'V', LDZ >= max(1,N).!>
WORK
!> WORK is REAL array,!> dimension (LWORK)!> On exit, if INFO = 0, WORK(1) returns the optimal LWORK.!>
(yes the original really does have that dramatic line break in the middle of the dimension clause. we respect the formatting choices π)
LWORK
!> LWORK is INTEGER!> The dimension of the array WORK.!> If JOBZ = 'N' or N <= 1 then LWORK must be at least 1.!> If JOBZ = 'V' and N > 1 then LWORK must be at least!> ( 1 + 4*N + N**2 ).!>!> If LWORK = -1, then a workspace query is assumed; the routine!> only calculates the optimal sizes of the WORK and IWORK!> arrays, returns these values as the first entries of the WORK!> and IWORK arrays, and no error message related to LWORK or!> LIWORK is issued by XERBLA.!>
π‘ the workspace-query glow-up: passLWORK = -1and she just tells you the optimal sizes ofWORKandIWORK, drops them into the first entries of theWORKandIWORKarrays, andXERBLAkeeps its mouth shut aboutLWORKorLIWORK. no error, just vibes β¨
IWORK
!> IWORK is INTEGER array, dimension (MAX(1,LIWORK))!> On exit, if INFO = 0, IWORK(1) returns the optimal LIWORK.!>
LIWORK
!> LIWORK is INTEGER!> The dimension of the array IWORK.!> If JOBZ = 'N' or N <= 1 then LIWORK must be at least 1.!> If JOBZ = 'V' and N > 1 then LIWORK must be at least 3+5*N.!>!> If LIWORK = -1, then a workspace query is assumed; the!> routine only calculates the optimal sizes of the WORK and!> IWORK arrays, returns these values as the first entries of!> the WORK and IWORK arrays, and no error message related to!> LWORK or LIWORK is issued by XERBLA.!>
same deal asLWORKbut for the integer side:LIWORK = -1means a workspace query, she computes the optimal sizes, hands them back as the first entries ofWORKandIWORK, andXERBLAstays quiet aboutLWORKorLIWORKπ§
INFO
!> INFO is INTEGER!> = 0: successful exit!> < 0: if INFO = -i, the i-th argument had an illegal value!> > 0: if INFO = i, the algorithm failed to converge; i!> off-diagonal elements of E did not converge to zero.!>
π¨ okay soINFO > 0means the algorithm failed to converge andioff-diagonal elements ofEdid not converge to zero. that's the bad timeline.INFO = 0is the slay timeline π
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
Definition at line 155 of file sstevd.f. π
π Author π
Generated automatically by Doxygen for LAPACK from the source code. (she was built different, by robots, and we love that for her π€π )
π bye bestie!! this page is from LAPACK, Version 3.12.0, file SRC/sstevd.f(3) β go get those eigenvalues, iykyk ππ
π¦ where this page comes from
- arch rolling: lapack-doc 3.12.1-2 Β· custom
- π girlified by deepseek-ai/DeepSeek-V4.1-Flash-1017 on : a language model's rewrite of the original, under its terms