slaed4 (l)  Linux Man Pages
slaed4: subroutine compute the Ith updated eigenvalue of a symmetric rankone modification to a diagonal matrix whose elements are given in the array d, and that D(i) < D(j) for i < j and that RHO > 0
NAME
SLAED4  subroutine compute the Ith updated eigenvalue of a symmetric rankone modification to a diagonal matrix whose elements are given in the array d, and that D(i) < D(j) for i < j and that RHO > 0SYNOPSIS
 SUBROUTINE SLAED4(
 N, I, D, Z, DELTA, RHO, DLAM, INFO )
 INTEGER I, INFO, N
 REAL DLAM, RHO
 REAL D( * ), DELTA( * ), Z( * )
PURPOSE
This subroutine computes the Ith updated eigenvalue of a symmetric rankone modification to a diagonal matrix whose elements are given in the array d, and that no loss in generality. The rankone modified system is thuswhere 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.
ARGUMENTS
 N (input) INTEGER
 The length of all arrays.
 I (input) INTEGER
 The index of the eigenvalue to be computed. 1 <= I <= N.
 D (input) REAL array, dimension (N)
 The original eigenvalues. It is assumed that they are in order, D(I) < D(J) for I < J.
 Z (input) REAL array, dimension (N)
 The components of the updating vector.
 DELTA (output) REAL array, dimension (N)
 If N .GT. 2, DELTA contains (D(j)  lambda_I) in its jth component. If N = 1, then DELTA(1) = 1. If N = 2, see SLAED5 for detail. The vector DELTA contains the information necessary to construct the eigenvectors by SLAED3 and SLAED9.
 RHO (input) REAL
 The scalar in the symmetric updating formula.
 DLAM (output) REAL
 The computed lambda_I, the Ith updated eigenvalue.
 INFO (output) INTEGER

= 0: successful exit
> 0: if INFO = 1, the updating process failed.
PARAMETERS
Logical variable ORGATI (originati?) 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 (switchfor3poles?) is for noting if we are working with THREE poles! MAXIT is the maximum number of iterations allowed for each eigenvalue. Further Details =============== Based on contributions by RenCang Li, Computer Science Division, University of California at Berkeley, USA