SLARRB(3)
π SLARRB(3) β Library Functions Manual π
This is the slarrb.f(3) page, bestie β living at /home/abui...RC/slarrb.f(3) and serving full Library Functions Manual energy. π
πΈ NAME πΈ
/home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/slarrb.fβ that's the file this whole page is about, no cap. π¦
β¨ SYNOPSIS β¨
π Functions/Subroutines π
subroutine SLARRB (n, d, lld, ifirst, ilast, rtol1, rtol2, offset, w,
wgap, werr, work, iwork, pivmin, spdiam, twist, info)
SLARRB provides limited bisection to locate eigenvalues for more accuracy. Like, that's its whole main-character job. π
π¦ Function/Subroutine Documentation π¦
π« subroutine SLARRB π«
subroutine SLARRB (integer n, real, dimension( * ) d, real, dimension( * )
lld, integer ifirst, integer ilast, real rtol1, real rtol2, integer
offset, real, dimension( * ) w, real, dimension( * ) wgap, real,
dimension( * ) werr, real, dimension( * ) work, integer, dimension( * )
iwork, real pivmin, real spdiam, integer twist, integer info)
SLARRB provides limited bisection to locate eigenvalues for more accuracy. β¨
π Purpose π
Okay so here's the vibe: given the relatively robust representation(RRR) L D L^T, SLARRB does bisection to refine the eigenvalues of L D L^T, W( IFIRST-OFFSET ) through W( ILAST-OFFSET ), to more accuracy. Initial guesses for these eigenvalues are input in W; the corresponding estimate of the error in these guesses and their gaps are input in WERR and WGAP, respectively. During bisection, intervals [left, right] are maintained by storing their mid-points and semi-widths in the arrays W and WERR respectively. It's giving precision-refinement era. π«Ά
π Parameters π
NβN is INTEGER; the order of the matrix. πDβD is REAL array, dimension (N); theNdiagonal elements of the diagonal matrixD. πΈLLDβLLD is REAL array, dimension (N-1); the(N-1)elementsL(i)*L(i)*D(i). π¦IFIRSTβIFIRST is INTEGER; the index of the first eigenvalue to be computed. βILASTβILAST is INTEGER; the index of the last eigenvalue to be computed. βRTOL1βRTOL1 is REAL. That's literally the whole note in the source, bestie β no extra description here. πRTOL2βRTOL2 is REAL; tolerance for the convergence of the bisection intervals. An interval[LEFT,RIGHT]has converged ifRIGHT-LEFT < MAX( RTOL1*GAP, RTOL2*MAX(|LEFT|,|RIGHT|) )whereGAPis the (estimated) distance to the nearest eigenvalue. Math girlie pop off. π₯OFFSETβOFFSET is INTEGER; offset for the arraysW,WGAPandWERR, i.e., theIFIRST-OFFSETthroughILAST-OFFSETelements of these arrays are to be used. πWβW is REAL array, dimension (N). On input,W( IFIRST-OFFSET )throughW( ILAST-OFFSET )are estimates of the eigenvalues ofL D L^TindexedIFIRSTthroughILAST. On output, these estimates are refined. πWGAPβWGAP is REAL array, dimension (N-1). On input, the (estimated) gaps between consecutive eigenvalues ofL D L^T, i.e.,WGAP(I-OFFSET)is the gap between eigenvaluesIandI+1. Note that ifIFIRST = ILASTthenWGAP(IFIRST-OFFSET)must be set toZERO. On output, these gaps are refined. π«ΆWERRβWERR is REAL array, dimension (N). On input,WERR( IFIRST-OFFSET )throughWERR( ILAST-OFFSET )are the errors in the estimates of the corresponding elements inW. On output, these errors are refined. πWORKβWORK is REAL array, dimension (2*N); workspace. π§IWORKβIWORK is INTEGER array, dimension (2*N); workspace. π§PIVMINβPIVMIN is REAL; the minimum pivot in the Sturm sequence. πSPDIAMβSPDIAM is REAL; the spectral diameter of the matrix. πTWISTβTWIST is INTEGER; the twist index for the twisted factorization that is used for the negcount. π«TWIST = N: Compute negcount fromL D L^T - LAMBDA I = L+ D+ L+^TTWIST = 1: Compute negcount fromL D L^T - LAMBDA I = U- D- U-^TTWIST = R: Compute negcount fromL D L^T - LAMBDA I = N(r) D(r) N(r)
INFOβINFO is INTEGER; error flag. π©
π Author π
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π«Ά Contributors: π«Ά
- Beresford Parlett, University of California, Berkeley, USA
- Jim Demmel, University of California, Berkeley, USA
- Inderjit Dhillon, University of Texas, Austin, USA
- Osni Marques, LBNL/NERSC, USA
- Christof Voemel, University of California, Berkeley, USA
Definition at line 193 of file slarrb.f. π
π§ Author π§
Generated automatically by Doxygen for LAPACK from the source code. π
π Okay that's the whole page, bestie β source/version sign-off: LAPACK Version 3.12.0, and the footer path vibe is /home/abui...RC/slarrb.f(3). Slay, bye! β¨
π¦ 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