de/db8/chb2st__kernels_8f_source.html

 *> \brief \b CHB2ST_KERNELS
 *
 *  @generated from zhb2st_kernels.f, fortran z -> c, Wed Dec  7 08:22:40 2016
 *
 *  =========== DOCUMENTATION ===========
 *
 * Online html documentation available at
 *            http://www.netlib.org/lapack/explore-html/
 *
 *> \htmlonly
 *> Download CHB2ST_KERNELS + dependencies
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/chb2st_kernels.f">
 *> [TGZ]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/chb2st_kernels.f">
 *> [ZIP]</a>
 *> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/chb2st_kernels.f">
 *> [TXT]</a>
 *> \endhtmlonly
 *
 *  Definition:
 *  ===========
 *
 *       SUBROUTINE  CHB2ST_KERNELS( UPLO, WANTZ, TTYPE,
 *                                   ST, ED, SWEEP, N, NB, IB,
 *                                   A, LDA, V, TAU, LDVT, WORK)
 *
 *       IMPLICIT NONE
 *
 *       .. Scalar Arguments ..
 *       CHARACTER          UPLO
 *       LOGICAL            WANTZ
 *       INTEGER            TTYPE, ST, ED, SWEEP, N, NB, IB, LDA, LDVT
 *       ..
 *       .. Array Arguments ..
 *       COMPLEX            A( LDA, * ), V( * ),
 *                          TAU( * ), WORK( * )
 *
 *> \par Purpose:
 *  =============
 *>
 *> \verbatim
 *>
 *> CHB2ST_KERNELS is an internal routine used by the CHETRD_HB2ST
 *> subroutine.
 *> \endverbatim
 *
 *  Arguments:
 *  ==========
 *
 *> \param[in] UPLO
 *> \verbatim
 *>          UPLO is CHARACTER*1
 *> \endverbatim
 *>
 *> \param[in] WANTZ
 *> \verbatim
 *>          WANTZ is LOGICAL which indicate if Eigenvalue are requested or both
 *>          Eigenvalue/Eigenvectors.
 *> \endverbatim
 *>
 *> \param[in] TTYPE
 *> \verbatim
 *>          TTYPE is INTEGER
 *> \endverbatim
 *>
 *> \param[in] ST
 *> \verbatim
 *>          ST is INTEGER
 *>          internal parameter for indices.
 *> \endverbatim
 *>
 *> \param[in] ED
 *> \verbatim
 *>          ED is INTEGER
 *>          internal parameter for indices.
 *> \endverbatim
 *>
 *> \param[in] SWEEP
 *> \verbatim
 *>          SWEEP is INTEGER
 *>          internal parameter for indices.
 *> \endverbatim
 *>
 *> \param[in] N
 *> \verbatim
 *>          N is INTEGER. The order of the matrix A.
 *> \endverbatim
 *>
 *> \param[in] NB
 *> \verbatim
 *>          NB is INTEGER. The size of the band.
 *> \endverbatim
 *>
 *> \param[in] IB
 *> \verbatim
 *>          IB is INTEGER.
 *> \endverbatim
 *>
 *> \param[in, out] A
 *> \verbatim
 *>          A is COMPLEX array. A pointer to the matrix A.
 *> \endverbatim
 *>
 *> \param[in] LDA
 *> \verbatim
 *>          LDA is INTEGER. The leading dimension of the matrix A.
 *> \endverbatim
 *>
 *> \param[out] V
 *> \verbatim
 *>          V is COMPLEX array, dimension 2*n if eigenvalues only are
 *>          requested or to be queried for vectors.
 *> \endverbatim
 *>
 *> \param[out] TAU
 *> \verbatim
 *>          TAU is COMPLEX array, dimension (2*n).
 *>          The scalar factors of the Householder reflectors are stored
 *>          in this array.
 *> \endverbatim
 *>
 *> \param[in] LDVT
 *> \verbatim
 *>          LDVT is INTEGER.
 *> \endverbatim
 *>
 *> \param[in] WORK
 *> \verbatim
 *>          WORK is COMPLEX array. Workspace of size nb.
 *> \endverbatim
 *>
 *> \par Further Details:
 *  =====================
 *>
 *> \verbatim
 *>
 *>  Implemented by Azzam Haidar.
 *>
 *>  All details are available on technical report, SC11, SC13 papers.
 *>
 *>  Azzam Haidar, Hatem Ltaief, and Jack Dongarra.
 *>  Parallel reduction to condensed forms for symmetric eigenvalue problems
 *>  using aggregated fine-grained and memory-aware kernels. In Proceedings
 *>  of 2011 International Conference for High Performance Computing,
 *>  Networking, Storage and Analysis (SC '11), New York, NY, USA,
 *>  Article 8 , 11 pages.
 *>  http://doi.acm.org/10.1145/2063384.2063394
 *>
 *>  A. Haidar, J. Kurzak, P. Luszczek, 2013.
 *>  An improved parallel singular value algorithm and its implementation
 *>  for multicore hardware, In Proceedings of 2013 International Conference
 *>  for High Performance Computing, Networking, Storage and Analysis (SC '13).
 *>  Denver, Colorado, USA, 2013.
 *>  Article 90, 12 pages.
 *>  http://doi.acm.org/10.1145/2503210.2503292
 *>
 *>  A. Haidar, R. Solca, S. Tomov, T. Schulthess and J. Dongarra.
 *>  A novel hybrid CPU-GPU generalized eigensolver for electronic structure
 *>  calculations based on fine-grained memory aware tasks.
 *>  International Journal of High Performance Computing Applications.
 *>  Volume 28 Issue 2, Pages 196-209, May 2014.
 *>  http://hpc.sagepub.com/content/28/2/196
 *>
 *> \endverbatim
 *>
 *  =====================================================================
       SUBROUTINE  chb2st_kernels( UPLO, WANTZ, TTYPE,
      $                            ST, ED, SWEEP, N, NB, IB,
      $                            A, LDA, V, TAU, LDVT, WORK)
 *
       IMPLICIT NONE
 *
 *  -- LAPACK computational routine (version 3.7.1) --
 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
 *     June 2017
 *
 *     .. Scalar Arguments ..
       CHARACTER          UPLO
       LOGICAL            WANTZ
       INTEGER            TTYPE, ST, ED, SWEEP, N, NB, IB, LDA, LDVT
 *     ..
 *     .. Array Arguments ..
       COMPLEX            A( lda, * ), V( * ),
      $                   tau( * ), work( * )
 *     ..
 *
 *  =====================================================================
 *
 *     .. Parameters ..
       COMPLEX            ZERO, ONE
       parameter( zero = ( 0.0e+0, 0.0e+0 ),
      $                   one = ( 1.0e+0, 0.0e+0 ) )
 *     ..
 *     .. Local Scalars ..
       LOGICAL            UPPER
       INTEGER            I, J1, J2, LM, LN, VPOS, TAUPOS,
      $                   dpos, ofdpos, ajeter
       COMPLEX            CTMP
 *     ..
 *     .. External Subroutines ..
       EXTERNAL           clarfg, clarfx, clarfy
 *     ..
 *     .. Intrinsic Functions ..
       INTRINSIC          conjg, mod
 *     .. External Functions ..
       LOGICAL            LSAME
       EXTERNAL           lsame
 *     ..
 *     ..
 *     .. Executable Statements ..
 *
       ajeter = ib + ldvt
       upper = lsame( uplo, 'U' )

       IF( upper ) THEN
           dpos    = 2 * nb + 1
           ofdpos  = 2 * nb
       ELSE
           dpos    = 1
           ofdpos  = 2
       ENDIF

 *
 *     Upper case
 *
       IF( upper ) THEN
 *
           IF( wantz ) THEN
               vpos   = mod( sweep-1, 2 ) * n + st
               taupos = mod( sweep-1, 2 ) * n + st
           ELSE
               vpos   = mod( sweep-1, 2 ) * n + st
               taupos = mod( sweep-1, 2 ) * n + st
           ENDIF
 *
           IF( ttype.EQ.1 ) THEN
               lm = ed - st + 1
 *
               v( vpos ) = one
               DO 10 i = 1, lm-1
                   v( vpos+i )         = conjg( a( ofdpos-i, st+i ) )
                   a( ofdpos-i, st+i ) = zero
    10         CONTINUE
               ctmp = conjg( a( ofdpos, st ) )
               CALL clarfg( lm, ctmp, v( vpos+1 ), 1,
      $                                       tau( taupos ) )
               a( ofdpos, st ) = ctmp
 *
               lm = ed - st + 1
               CALL clarfy( uplo, lm, v( vpos ), 1,
      $                     conjg( tau( taupos ) ),
      $                     a( dpos, st ), lda-1, work)
           ENDIF
 *
           IF( ttype.EQ.3 ) THEN
 *
               lm = ed - st + 1
               CALL clarfy( uplo, lm, v( vpos ), 1,
      $                     conjg( tau( taupos ) ),
      $                     a( dpos, st ), lda-1, work)
           ENDIF
 *
           IF( ttype.EQ.2 ) THEN
               j1 = ed+1
               j2 = min( ed+nb, n )
               ln = ed-st+1
               lm = j2-j1+1
               IF( lm.GT.0) THEN
                   CALL clarfx( 'Left', ln, lm, v( vpos ),
      $                         conjg( tau( taupos ) ),
      $                         a( dpos-nb, j1 ), lda-1, work)
 *
                   IF( wantz ) THEN
                       vpos   = mod( sweep-1, 2 ) * n + j1
                       taupos = mod( sweep-1, 2 ) * n + j1
                   ELSE
                       vpos   = mod( sweep-1, 2 ) * n + j1
                       taupos = mod( sweep-1, 2 ) * n + j1
                   ENDIF
 *
                   v( vpos ) = one
                   DO 30 i = 1, lm-1
                       v( vpos+i )          =
      $                                    conjg( a( dpos-nb-i, j1+i ) )
                       a( dpos-nb-i, j1+i ) = zero
    30             CONTINUE
                   ctmp = conjg( a( dpos-nb, j1 ) )
                   CALL clarfg( lm, ctmp, v( vpos+1 ), 1, tau( taupos ) )
                   a( dpos-nb, j1 ) = ctmp
 *
                   CALL clarfx( 'Right', ln-1, lm, v( vpos ),
      $                         tau( taupos ),
      $                         a( dpos-nb+1, j1 ), lda-1, work)
               ENDIF
           ENDIF
 *
 *     Lower case
 *
       ELSE
 *
           IF( wantz ) THEN
               vpos   = mod( sweep-1, 2 ) * n + st
               taupos = mod( sweep-1, 2 ) * n + st
           ELSE
               vpos   = mod( sweep-1, 2 ) * n + st
               taupos = mod( sweep-1, 2 ) * n + st
           ENDIF
 *
           IF( ttype.EQ.1 ) THEN
               lm = ed - st + 1
 *
               v( vpos ) = one
               DO 20 i = 1, lm-1
                   v( vpos+i )         = a( ofdpos+i, st-1 )
                   a( ofdpos+i, st-1 ) = zero
    20         CONTINUE
               CALL clarfg( lm, a( ofdpos, st-1 ), v( vpos+1 ), 1,
      $                                       tau( taupos ) )
 *
               lm = ed - st + 1
 *
               CALL clarfy( uplo, lm, v( vpos ), 1,
      $                     conjg( tau( taupos ) ),
      $                     a( dpos, st ), lda-1, work)

           ENDIF
 *
           IF( ttype.EQ.3 ) THEN
               lm = ed - st + 1
 *
               CALL clarfy( uplo, lm, v( vpos ), 1,
      $                     conjg( tau( taupos ) ),
      $                     a( dpos, st ), lda-1, work)

           ENDIF
 *
           IF( ttype.EQ.2 ) THEN
               j1 = ed+1
               j2 = min( ed+nb, n )
               ln = ed-st+1
               lm = j2-j1+1
 *
               IF( lm.GT.0) THEN
                   CALL clarfx( 'Right', lm, ln, v( vpos ),
      $                         tau( taupos ), a( dpos+nb, st ),
      $                         lda-1, work)
 *
                   IF( wantz ) THEN
                       vpos   = mod( sweep-1, 2 ) * n + j1
                       taupos = mod( sweep-1, 2 ) * n + j1
                   ELSE
                       vpos   = mod( sweep-1, 2 ) * n + j1
                       taupos = mod( sweep-1, 2 ) * n + j1
                   ENDIF
 *
                   v( vpos ) = one
                   DO 40 i = 1, lm-1
                       v( vpos+i )        = a( dpos+nb+i, st )
                       a( dpos+nb+i, st ) = zero
    40             CONTINUE
                   CALL clarfg( lm, a( dpos+nb, st ), v( vpos+1 ), 1,
      $                                        tau( taupos ) )
 *
                   CALL clarfx( 'Left', lm, ln-1, v( vpos ),
      $                         conjg( tau( taupos ) ),
      $                         a( dpos+nb-1, st+1 ), lda-1, work)

               ENDIF
           ENDIF
       ENDIF
 *
       RETURN
 *
 *     END OF CHB2ST_KERNELS
 *
       END
chb2st_kernels
subroutine chb2st_kernels(UPLO, WANTZ, TTYPE, ST, ED, SWEEP, N, NB, IB, A, LDA, V, TAU, LDVT, WORK)
CHB2ST_KERNELS
Definition: chb2st_kernels.f:170

clarfx
subroutine clarfx(SIDE, M, N, V, TAU, C, LDC, WORK)
CLARFX applies an elementary reflector to a general rectangular matrix, with loop unrolling when the ...
Definition: clarfx.f:121

clarfg
subroutine clarfg(N, ALPHA, X, INCX, TAU)
CLARFG generates an elementary reflector (Householder matrix).
Definition: clarfg.f:108

clarfy
subroutine clarfy(UPLO, N, V, INCV, TAU, C, LDC, WORK)
CLARFY
Definition: clarfy.f:110