dlarrf (l) - Linux Manuals

dlarrf: the initial representation L D L^T and its cluster of close eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ..

NAME

DLARRF - the initial representation L D L^T and its cluster of close eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ..

SYNOPSIS

SUBROUTINE DLARRF(
N, D, L, LD, CLSTRT, CLEND, W, WGAP, WERR, SPDIAM, CLGAPL, CLGAPR, PIVMIN, SIGMA, DPLUS, LPLUS, WORK, INFO )

    
INTEGER CLSTRT, CLEND, INFO, N

    
DOUBLE PRECISION CLGAPL, CLGAPR, PIVMIN, SIGMA, SPDIAM

    
DOUBLE PRECISION D( * ), DPLUS( * ), L( * ), LD( * ), LPLUS( * ), W( * ), WGAP( * ), WERR( * ), WORK( * )

PURPOSE

Given the initial representation L D L^T and its cluster of close eigenvalues (in a relative measure), W( CLSTRT ), W( CLSTRT+1 ), ... W( CLEND ), DLARRF finds a new relatively robust representation L D L^T - SIGMA I = L(+) D(+) L(+)^T such that at least one of the eigenvalues of L(+) D(+) L(+)^T is relatively isolated.

ARGUMENTS

N (input) INTEGER
The order of the matrix (subblock, if the matrix splitted).
D (input) DOUBLE PRECISION array, dimension (N)
The N diagonal elements of the diagonal matrix D.
L (input) DOUBLE PRECISION array, dimension (N-1)
The (N-1) subdiagonal elements of the unit bidiagonal matrix L.
LD (input) DOUBLE PRECISION array, dimension (N-1)
The (N-1) elements L(i)*D(i).
CLSTRT (input) INTEGER
The index of the first eigenvalue in the cluster.
CLEND (input) INTEGER
The index of the last eigenvalue in the cluster.
W (input) DOUBLE PRECISION array, dimension >= (CLEND-CLSTRT+1)
The eigenvalue APPROXIMATIONS of L D L^T in ascending order. W( CLSTRT ) through W( CLEND ) form the cluster of relatively close eigenalues.
WGAP (input/output) DOUBLE PRECISION array, dimension >= (CLEND-CLSTRT+1)
The separation from the right neighbor eigenvalue in W.
WERR (input) DOUBLE PRECISION array, dimension >= (CLEND-CLSTRT+1)
WERR contain the semiwidth of the uncertainty interval of the corresponding eigenvalue APPROXIMATION in W SPDIAM (input) estimate of the spectral diameter obtained from the Gerschgorin intervals CLGAPL, CLGAPR (input) absolute gap on each end of the cluster. Set by the calling routine to protect against shifts too close to eigenvalues outside the cluster.
PIVMIN (input) DOUBLE PRECISION
The minimum pivot allowed in the Sturm sequence.
SIGMA (output) DOUBLE PRECISION
The shift used to form L(+) D(+) L(+)^T.
DPLUS (output) DOUBLE PRECISION array, dimension (N)
The N diagonal elements of the diagonal matrix D(+).
LPLUS (output) DOUBLE PRECISION array, dimension (N-1)
The first (N-1) elements of LPLUS contain the subdiagonal elements of the unit bidiagonal matrix L(+).
WORK (workspace) DOUBLE PRECISION array, dimension (2*N)
Workspace.

FURTHER DETAILS

Based on contributions by

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

Pages related to dlarrf

  • dlarrf (3)
  • dlarra (l) - the splitting points with threshold SPLTOL
  • dlarrb (l) - the relatively robust representation(RRR) L D L^T, DLARRB does "limited" bisection to refine the eigenvalues of L D L^T,
  • dlarrc (l) - the number of eigenvalues of the symmetric tridiagonal matrix T that are in the interval (VL,VU] if JOBT = aqTaq, and of L D L^T if JOBT = aqLaq
  • dlarrd (l) - computes the eigenvalues of a symmetric tridiagonal matrix T to suitable accuracy
  • dlarre (l) - find the desired eigenvalues of a given real symmetric tridiagonal matrix T, DLARRE sets any "small" off-diagonal elements to zero, and for each unreduced block T_i, it finds (a) a suitable shift at one end of the blockaqs spectrum,
  • dlarrj (l) - the initial eigenvalue approximations of T, DLARRJ does bisection to refine the eigenvalues of T,
  • dlarrk (l) - computes one eigenvalue of a symmetric tridiagonal matrix T to suitable accuracy
  • dlarrr (l) - tests to decide whether the symmetric tridiagonal matrix T warrants expensive computations which guarantee high relative accuracy in the eigenvalues
  • dlarrv (l) - computes the eigenvectors of the tridiagonal matrix T = L D L^T given L, D and APPROXIMATIONS to the eigenvalues of L D L^T
  • dlar1v (l) - computes the (scaled) r-th column of the inverse of the sumbmatrix in rows B1 through BN of the tridiagonal matrix L D L^T - sigma I