dlaed3 (l) - Linux Manuals

dlaed3: finds the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K

NAME

DLAED3 - finds the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K

SYNOPSIS

SUBROUTINE DLAED3(
K, N, N1, D, Q, LDQ, RHO, DLAMDA, Q2, INDX, CTOT, W, S, INFO )

    
INTEGER INFO, K, LDQ, N, N1

    
DOUBLE PRECISION RHO

    
INTEGER CTOT( * ), INDX( * )

    
DOUBLE PRECISION D( * ), DLAMDA( * ), Q( LDQ, * ), Q2( * ), S( * ), W( * )

PURPOSE

DLAED3 finds the roots of the secular equation, as defined by the values in D, W, and RHO, between 1 and K. It makes the appropriate calls to DLAED4 and then updates the eigenvectors by multiplying the matrix of eigenvectors of the pair of eigensystems being combined by the matrix of eigenvectors of the K-by-K system which is solved here.
This code makes very mild assumptions about floating point arithmetic. It will work on machines with a guard digit in add/subtract, or on those binary machines without guard digits which subtract like the Cray X-MP, Cray Y-MP, Cray C-90, or Cray-2. It could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none.

ARGUMENTS

K (input) INTEGER
The number of terms in the rational function to be solved by DLAED4. K >= 0.
N (input) INTEGER
The number of rows and columns in the Q matrix. N >= K (deflation may result in N>K).
N1 (input) INTEGER
The location of the last eigenvalue in the leading submatrix. min(1,N) <= N1 <= N/2.
D (output) DOUBLE PRECISION array, dimension (N)
D(I) contains the updated eigenvalues for 1 <= I <= K.
Q (output) DOUBLE PRECISION array, dimension (LDQ,N)
Initially the first K columns are used as workspace. On output the columns 1 to K contain the updated eigenvectors.
LDQ (input) INTEGER
The leading dimension of the array Q. LDQ >= max(1,N).
RHO (input) DOUBLE PRECISION
The value of the parameter in the rank one update equation. RHO >= 0 required.
DLAMDA (input/output) DOUBLE PRECISION array, dimension (K)
The first K elements of this array contain the old roots of the deflated updating problem. These are the poles of the secular equation. May be changed on output by having lowest order bit set to zero on Cray X-MP, Cray Y-MP, Cray-2, or Cray C-90, as described above.
Q2 (input) DOUBLE PRECISION array, dimension (LDQ2, N)
The first K columns of this matrix contain the non-deflated eigenvectors for the split problem.
INDX (input) INTEGER array, dimension (N)
The permutation used to arrange the columns of the deflated Q matrix into three groups (see DLAED2). The rows of the eigenvectors found by DLAED4 must be likewise permuted before the matrix multiply can take place.
CTOT (input) INTEGER array, dimension (4)
A count of the total number of the various types of columns in Q, as described in INDX. The fourth column type is any column which has been deflated.
W (input/output) DOUBLE PRECISION array, dimension (K)
The first K elements of this array contain the components of the deflation-adjusted updating vector. Destroyed on output.
S (workspace) DOUBLE PRECISION array, dimension (N1 + 1)*K
Will contain the eigenvectors of the repaired matrix which will be multiplied by the previously accumulated eigenvectors to update the system.
LDS (input) INTEGER
The leading dimension of S. LDS >= max(1,K).
INFO (output) INTEGER
= 0: successful exit.
< 0: if INFO = -i, the i-th argument had an illegal value.
> 0: if INFO = 1, an eigenvalue did not converge

FURTHER DETAILS

Based on contributions by

Jeff Rutter, Computer Science Division, University of California
at Berkeley, USA
Modified by Francoise Tisseur, University of Tennessee.

Pages related to dlaed3

  • dlaed3 (3)
  • dlaed0 (l) - computes all eigenvalues and corresponding eigenvectors of a symmetric tridiagonal matrix using the divide and conquer method
  • dlaed1 (l) - computes the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
  • dlaed2 (l) - merges the two sets of eigenvalues together into a single sorted set
  • dlaed4 (l) - subroutine compute the I-th updated eigenvalue of a symmetric rank-one 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
  • dlaed5 (l) - subroutine compute the I-th eigenvalue of a symmetric rank-one modification of a 2-by-2 diagonal matrix diag( D ) + RHO The diagonal elements in the array D are assumed to satisfy D(i) < D(j) for i < j
  • dlaed6 (l) - computes the positive or negative root (closest to the origin) of z(1) z(2) z(3) f(x) = rho + --------- + ---------- + --------- d(1)-x d(2)-x d(3)-x It is assumed that if ORGATI = .true
  • dlaed7 (l) - computes the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
  • dlaed8 (l) - merges the two sets of eigenvalues together into a single sorted set
  • dlaed9 (l) - finds the roots of the secular equation, as defined by the values in D, Z, and RHO, between KSTART and KSTOP
  • dlaeda (l) - computes the Z vector corresponding to the merge step in the CURLVLth step of the merge process with TLVLS steps for the CURPBMth problem