SLASD4(3)
π SLASD4(3) β like, the whole manual, bestie β¨
okay so this page lives in the Library Functions Manual section, and its file is literally /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/slasd4.f β that's the path, that's the name, that's the whole NAME section, slay π
β¨ SYNOPSIS β¨
πΈ Functions/Subroutines
subroutine SLASD4 (n, i, d, z, delta, rho, sigma, work, info)β SLASD4 computes the square root of the i-th updated eigenvalue of a positive symmetric rank-one modification to a positive diagonal matrix. Used bysbdsdc.
π¦ Function/Subroutine Documentation π¦
subroutine SLASD4 (integer n, integer i, real, dimension( * ) d, real,
dimension( * ) z, real, dimension( * ) delta, real rho, real sigma,
real, dimension( * ) work, integer info)
SLASD4 computes the square root of the i-th updated eigenvalue of a positive symmetric rank-one modification to a positive diagonal matrix. Used by sbdsdc. no cap, that's the whole gig π
π Purpose:
!>
!> This subroutine computes the square root of the I-th updated
!> eigenvalue of a positive symmetric rank-one modification to
!> a positive diagonal matrix whose entries are given as the squares
!> of the corresponding entries in the array d, and that
!>
!> 0 <= D(i) < D(j) for i < j
!>
!> and that RHO > 0. This is arranged by the calling routine, and is
!> no loss in generality. The rank-one modified system is thus
!>
!> diag( D ) * diag( D ) + RHO * Z * Z_transpose.
!>
!> where we assume the Euclidean norm of Z is 1.
!>
!> The method consists of approximating the rational functions in the
!> secular equation by simpler interpolating rational functions.
!>
so like, it's giving "find the square root of the I-th updated eigenvalue" of a positive symmetric rank-one modification to a positive diagonal matrix β and the diagonal entries are the squares of the entries in d. the ordering 0 <= D(i) < D(j) for i < j, plus RHO > 0, is all set up by whoever calls this routine, and it's no loss in generality, periodt. the rank-one modified system is diag( D ) * diag( D ) + RHO * Z * Z_transpose. and we're assuming the Euclidean norm of Z is 1. the method? approximating the rational functions in the secular equation by simpler interpolating rational functions. iconique π₯
π Parameters π
NβN is INTEGER. The length of all arrays. that's it, that's the vibe.IβI is INTEGER. The index of the eigenvalue to be computed.1 <= I <= N.DβD is REAL array, dimension ( N ). The original eigenvalues. It is assumed that they are in order,0 <= D(I) < D(J)forI < J. mind the ordering bestie, it's load-bearing πZβZ is REAL array, dimension ( N ). The components of the updating vector.DELTAβDELTA is REAL array, dimension ( N ). IfN .ne. 1,DELTAcontains(D(j) - sigma_I)in its j-th component. IfN = 1, thenDELTA(1) = 1. The vectorDELTAcontains the information necessary to construct the (singular) eigenvectors. yes the eigenvectors are singular, we love that for them πRHOβRHO is REAL. The scalar in the symmetric updating formula.SIGMAβSIGMA is REAL. The computedsigma_I, the I-th updated eigenvalue. the main character of this whole operation ngl πWORKβWORK is REAL array, dimension ( N ). IfN .ne. 1,WORKcontains(D(j) + sigma_I)in its j-th component. IfN = 1, thenWORK( 1 ) = 1.INFOβINFO is INTEGER. Exit status vibes:= 0: successful exit π> 0: ifINFO = 1, the updating process failed. π it happens to the best of us.
π Internal Parameters:
!> Logical variable ORGATI (origin-at-i?) is used for distinguishing
!> whether D(i) or D(i+1) is treated as the origin.
!>
!> ORGATI = .true. origin at i
!> ORGATI = .false. origin at i+1
!>
!> Logical variable SWTCH3 (switch-for-3-poles?) is for noting
!> if we are working with THREE poles!
!>
!> MAXIT is the maximum number of iterations allowed for each
!> eigenvalue.
!>
okay so breaking the lore down for you π§
- The logical variable
ORGATI(origin-at-i?) distinguishes whetherD(i)orD(i+1)is treated as the origin.ORGATI = .true.β origin at iORGATI = .false.β origin at i+1
- The logical variable
SWTCH3(switch-for-3-poles?) is for noting if we are working with THREE poles! three!! π«Ά MAXITis the maximum number of iterations allowed for each eigenvalue.
π Author
- Univ. of Tennessee
- Univ. of California Berkeley
- Univ. of Colorado Denver
- NAG Ltd.
π Contributors:
Ren-Cang Li, Computer Science Division, University of California at Berkeley, USA. legend behaviour, honestly π
Definition at line 152 of file slasd4.f.
β Author β
Generated automatically by Doxygen for LAPACK from the source code. (yes, a robot wrote this, and it ate π€β¨)
okay so that's the whole page!! this is LAPACK, Version 3.12.0, and the source file is /home/abui...RC/slasd4.f(3) β that's the date/version bit at the bottom, folded in all cute for you. bye bestie, go compute some eigenvalues π¦π
π¦ 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