dlaptm.f

Go to the documentation of this file.

*> \brief \b DLAPTM
*
*  =========== DOCUMENTATION ===========
*
* Online html documentation available at 
*            http://www.netlib.org/lapack/explore-html/ 
*
*  Definition:
*  ===========
*
*       SUBROUTINE DLAPTM( N, NRHS, ALPHA, D, E, X, LDX, BETA, B, LDB )
* 
*       .. Scalar Arguments ..
*       INTEGER            LDB, LDX, N, NRHS
*       DOUBLE PRECISION   ALPHA, BETA
*       ..
*       .. Array Arguments ..
*       DOUBLE PRECISION   B( LDB, * ), D( * ), E( * ), X( LDX, * )
*       ..
*  
*
*> \par Purpose:
*  =============
*>
*> \verbatim
*>
*> DLAPTM multiplies an N by NRHS matrix X by a symmetric tridiagonal
*> matrix A and stores the result in a matrix B.  The operation has the
*> form
*>
*>    B := alpha * A * X + beta * B
*>
*> where alpha may be either 1. or -1. and beta may be 0., 1., or -1.
*> \endverbatim
*
*  Arguments:
*  ==========
*
*> \param[in] N
*> \verbatim
*>          N is INTEGER
*>          The order of the matrix A.  N >= 0.
*> \endverbatim
*>
*> \param[in] NRHS
*> \verbatim
*>          NRHS is INTEGER
*>          The number of right hand sides, i.e., the number of columns
*>          of the matrices X and B.
*> \endverbatim
*>
*> \param[in] ALPHA
*> \verbatim
*>          ALPHA is DOUBLE PRECISION
*>          The scalar alpha.  ALPHA must be 1. or -1.; otherwise,
*>          it is assumed to be 0.
*> \endverbatim
*>
*> \param[in] D
*> \verbatim
*>          D is DOUBLE PRECISION array, dimension (N)
*>          The n diagonal elements of the tridiagonal matrix A.
*> \endverbatim
*>
*> \param[in] E
*> \verbatim
*>          E is DOUBLE PRECISION array, dimension (N-1)
*>          The (n-1) subdiagonal or superdiagonal elements of A.
*> \endverbatim
*>
*> \param[in] X
*> \verbatim
*>          X is DOUBLE PRECISION array, dimension (LDX,NRHS)
*>          The N by NRHS matrix X.
*> \endverbatim
*>
*> \param[in] LDX
*> \verbatim
*>          LDX is INTEGER
*>          The leading dimension of the array X.  LDX >= max(N,1).
*> \endverbatim
*>
*> \param[in] BETA
*> \verbatim
*>          BETA is DOUBLE PRECISION
*>          The scalar beta.  BETA must be 0., 1., or -1.; otherwise,
*>          it is assumed to be 1.
*> \endverbatim
*>
*> \param[in,out] B
*> \verbatim
*>          B is DOUBLE PRECISION array, dimension (LDB,NRHS)
*>          On entry, the N by NRHS matrix B.
*>          On exit, B is overwritten by the matrix expression
*>          B := alpha * A * X + beta * B.
*> \endverbatim
*>
*> \param[in] LDB
*> \verbatim
*>          LDB is INTEGER
*>          The leading dimension of the array B.  LDB >= max(N,1).
*> \endverbatim
*
*  Authors:
*  ========
*
*> \author Univ. of Tennessee 
*> \author Univ. of California Berkeley 
*> \author Univ. of Colorado Denver 
*> \author NAG Ltd. 
*
*> \date November 2011
*
*> \ingroup double_lin
*
*  =====================================================================
      SUBROUTINE dlaptm( N, NRHS, ALPHA, D, E, X, LDX, BETA, B, LDB )
*
*  -- LAPACK test routine (version 3.4.0) --
*  -- LAPACK is a software package provided by Univ. of Tennessee,    --
*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
*     November 2011
*
*     .. Scalar Arguments ..
      INTEGER            LDB, LDX, N, NRHS
      DOUBLE PRECISION   ALPHA, BETA
*     ..
*     .. Array Arguments ..
      DOUBLE PRECISION   B( ldb, * ), D( * ), E( * ), X( ldx, * )
*     ..
*
*  =====================================================================
*
*     .. Parameters ..
      DOUBLE PRECISION   ONE, ZERO
      parameter                ( one = 1.0d+0, zero = 0.0d+0 )
*     ..
*     .. Local Scalars ..
      INTEGER            I, J
*     ..
*     .. Executable Statements ..
*
      IF( n.EQ.0 )
     $   RETURN
*
*     Multiply B by BETA if BETA.NE.1.
*
      IF( beta.EQ.zero ) THEN
         DO 20 j = 1, nrhs
            DO 10 i = 1, n
               b( i, j ) = zero
   10       CONTINUE
   20    CONTINUE
      ELSE IF( beta.EQ.-one ) THEN
         DO 40 j = 1, nrhs
            DO 30 i = 1, n
               b( i, j ) = -b( i, j )
   30       CONTINUE
   40    CONTINUE
      END IF
*
      IF( alpha.EQ.one ) THEN
*
*        Compute B := B + A*X
*
         DO 60 j = 1, nrhs
            IF( n.EQ.1 ) THEN
               b( 1, j ) = b( 1, j ) + d( 1 )*x( 1, j )
            ELSE
               b( 1, j ) = b( 1, j ) + d( 1 )*x( 1, j ) +
     $                     e( 1 )*x( 2, j )
               b( n, j ) = b( n, j ) + e( n-1 )*x( n-1, j ) +
     $                     d( n )*x( n, j )
               DO 50 i = 2, n - 1
                  b( i, j ) = b( i, j ) + e( i-1 )*x( i-1, j ) +
     $                        d( i )*x( i, j ) + e( i )*x( i+1, j )
   50          CONTINUE
            END IF
   60    CONTINUE
      ELSE IF( alpha.EQ.-one ) THEN
*
*        Compute B := B - A*X
*
         DO 80 j = 1, nrhs
            IF( n.EQ.1 ) THEN
               b( 1, j ) = b( 1, j ) - d( 1 )*x( 1, j )
            ELSE
               b( 1, j ) = b( 1, j ) - d( 1 )*x( 1, j ) -
     $                     e( 1 )*x( 2, j )
               b( n, j ) = b( n, j ) - e( n-1 )*x( n-1, j ) -
     $                     d( n )*x( n, j )
               DO 70 i = 2, n - 1
                  b( i, j ) = b( i, j ) - e( i-1 )*x( i-1, j ) -
     $                        d( i )*x( i, j ) - e( i )*x( i+1, j )
   70          CONTINUE
            END IF
   80    CONTINUE
      END IF
      RETURN
*
*     End of DLAPTM
*
      END