DLAR1V(3)

πŸ“¦ version 3.12.0, in opensuse-leap 16.0

πŸ’… NAME

This is DLAR1V(3), bestie β€” a Library Functions Manual page for the LAPACK file /home/abuild/rpmbuild/BUILD/lapack-static-3.12.0-build/lapack-3.12.0/SRC/dlar1v.f. The original header path is /home/abui...RC/dlar1v.f(3). ✨


✨ SYNOPSIS ✨

πŸ¦‹ Functions/Subroutines πŸ¦‹

subroutine DLAR1V (n, b1, bn, lambda, d, l, ld, lld, pivmin, gaptol, z,
    wantnc, negcnt, ztz, mingma, r, isuppz, nrminv, resid, rqcorr, work)

DLAR1V computes the (scaled) r-th column of the inverse of the submatrix in rows b1 through bn of the tridiagonal matrix LDLT - Ξ»I. πŸ’–


🧚 Function/Subroutine Documentation 🧚

Here’s the full signature, no cap:

subroutine DLAR1V (integer n, integer b1, integer bn, double precision
    lambda, double precision, dimension( * ) d, double precision, dimension(
    * ) l, double precision, dimension( * ) ld, double precision, dimension(
    * ) lld, double precision pivmin, double precision gaptol, double
    precision, dimension( * ) z, logical wantnc, integer negcnt, double
    precision ztz, double precision mingma, integer r, integer, dimension( *
    ) isuppz, double precision nrminv, double precision resid, double
    precision rqcorr, double precision, dimension( * ) work)

DLAR1V computes the (scaled) r-th column of the inverse of the submatrix in rows b1 through bn of the tridiagonal matrix LDLT - Ξ»I. Slay. πŸ’…

🌸 Purpose 🌸

Okay so picture this: DLAR1V computes the (scaled) r-th column of the inverse of the sumbmatrix β€” yes, the original really says β€œsumbmatrix,” we’re keeping that energy 😭 β€” in rows B1 through BN of the tridiagonal matrix L D L**T - sigma I.

When sigma is close to an eigenvalue, the computed vector is an accurate eigenvector. Usually, r corresponds to the index where the eigenvector is largest in magnitude. Iconic behavior, honestly. πŸ‘‘

The following steps accomplish this computation:

  1. Stationary qd transform:
L D L**T - sigma I = L(+) D(+) L(+)**T
  1. Progressive qd transform:
L D L**T - sigma I = U(-) D(-) U(-)**T
  1. Computation of the diagonal elements of the inverse of L D L**T - sigma I by combining the above transforms, and choosing r as the index where the diagonal of the inverse is (one of the) largest in magnitude.
  2. Computation of the (scaled) r-th column of the inverse using the twisted factorization obtained by combining the top part of the stationary and the bottom part of the progressive transform. (The original has a little β€œthe the” moment here β€” we love a typo moment. 🫢)

🌸 Parameters 🌸

  • N β€” INTEGER. The order of the matrix L D L**T.
  • B1 β€” INTEGER. First index of the submatrix of L D L**T.
  • BN β€” INTEGER. Last index of the submatrix of L D L**T.
  • LAMBDA β€” DOUBLE PRECISION. The shift. In order to compute an accurate eigenvector, LAMBDA should be a good approximation to an eigenvalue of L D L**T.
  • L β€” DOUBLE PRECISION array, dimension (N-1). The (n-1) subdiagonal elements of the unit bidiagonal matrix L, in elements 1 to N-1.
  • D β€” DOUBLE PRECISION array, dimension (N). The n diagonal elements of the diagonal matrix D.
  • LD β€” DOUBLE PRECISION array, dimension (N-1). The n-1 elements L(i)*D(i).
  • LLD β€” DOUBLE PRECISION array, dimension (N-1). The n-1 elements L(i)*L(i)*D(i).
  • PIVMIN β€” DOUBLE PRECISION. The minimum pivot in the Sturm sequence.
  • GAPTOL β€” DOUBLE PRECISION. Tolerance that indicates when eigenvector entries are negligible w.r.t. their contribution to the residual.
  • Z β€” DOUBLE PRECISION array, dimension (N). On input, all entries of Z must be set to 0. On output, Z contains the (scaled) r-th column of the inverse. The scaling is such that Z(R) equals 1.
  • WANTNC β€” LOGICAL. Specifies whether NEGCNT has to be computed.
  • NEGCNT β€” INTEGER. If WANTNC is .TRUE. then NEGCNT = the number of pivots < pivmin in the matrix factorization L D L**T, and NEGCNT = -1 otherwise.
  • ZTZ β€” DOUBLE PRECISION. The square of the 2-norm of Z.
  • MINGMA β€” DOUBLE PRECISION. The reciprocal of the largest (in magnitude) diagonal element of the inverse of L D L**T - sigma I.
  • R β€” INTEGER. The twist index for the twisted factorization used to compute Z. On input, 0 <= R <= N. If R is input as 0, R is set to the index where (L D L**T - sigma I)^{-1} is largest in magnitude. If 1 <= R <= N, R is unchanged. On output, R contains the twist index used to compute Z. Ideally, R designates the position of the maximum entry in the eigenvector.
  • ISUPPZ β€” INTEGER array, dimension (2). The support of the vector in Z, i.e., the vector Z is nonzero only in elements ISUPPZ(1) through ISUPPZ( 2 ).
  • NRMINV β€” DOUBLE PRECISION. NRMINV = 1/SQRT( ZTZ ).
  • RESID β€” DOUBLE PRECISION. The residual of the FP vector. RESID = ABS( MINGMA )/SQRT( ZTZ ).
  • RQCORR β€” DOUBLE PRECISION. The Rayleigh Quotient correction to LAMBDA. RQCORR = MINGMA*TMP.
  • WORK β€” DOUBLE PRECISION array, dimension (4*N).

πŸ‘‘ 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 227 of file dlar1v.f.


πŸͺ„ Author πŸͺ„

Generated automatically by Doxygen for LAPACK from the source code.


LAPACK Version 3.12.0, footer path /home/abui...RC/dlar1v.f(3) β€” that’s the whole vibe, bestie. πŸ’–βœ¨

πŸ“¦ where this page comes from