LAPACK 3.3.0

claqsp.f

Go to the documentation of this file.
00001       SUBROUTINE CLAQSP( UPLO, N, AP, S, SCOND, AMAX, EQUED )
00002 *
00003 *  -- LAPACK auxiliary routine (version 3.2) --
00004 *  -- LAPACK is a software package provided by Univ. of Tennessee,    --
00005 *  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--
00006 *     November 2006
00007 *
00008 *     .. Scalar Arguments ..
00009       CHARACTER          EQUED, UPLO
00010       INTEGER            N
00011       REAL               AMAX, SCOND
00012 *     ..
00013 *     .. Array Arguments ..
00014       REAL               S( * )
00015       COMPLEX            AP( * )
00016 *     ..
00017 *
00018 *  Purpose
00019 *  =======
00020 *
00021 *  CLAQSP equilibrates a symmetric matrix A using the scaling factors
00022 *  in the vector S.
00023 *
00024 *  Arguments
00025 *  =========
00026 *
00027 *  UPLO    (input) CHARACTER*1
00028 *          Specifies whether the upper or lower triangular part of the
00029 *          symmetric matrix A is stored.
00030 *          = 'U':  Upper triangular
00031 *          = 'L':  Lower triangular
00032 *
00033 *  N       (input) INTEGER
00034 *          The order of the matrix A.  N >= 0.
00035 *
00036 *  AP      (input/output) COMPLEX array, dimension (N*(N+1)/2)
00037 *          On entry, the upper or lower triangle of the symmetric matrix
00038 *          A, packed columnwise in a linear array.  The j-th column of A
00039 *          is stored in the array AP as follows:
00040 *          if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j;
00041 *          if UPLO = 'L', AP(i + (j-1)*(2n-j)/2) = A(i,j) for j<=i<=n.
00042 *
00043 *          On exit, the equilibrated matrix:  diag(S) * A * diag(S), in
00044 *          the same storage format as A.
00045 *
00046 *  S       (input) REAL array, dimension (N)
00047 *          The scale factors for A.
00048 *
00049 *  SCOND   (input) REAL
00050 *          Ratio of the smallest S(i) to the largest S(i).
00051 *
00052 *  AMAX    (input) REAL
00053 *          Absolute value of largest matrix entry.
00054 *
00055 *  EQUED   (output) CHARACTER*1
00056 *          Specifies whether or not equilibration was done.
00057 *          = 'N':  No equilibration.
00058 *          = 'Y':  Equilibration was done, i.e., A has been replaced by
00059 *                  diag(S) * A * diag(S).
00060 *
00061 *  Internal Parameters
00062 *  ===================
00063 *
00064 *  THRESH is a threshold value used to decide if scaling should be done
00065 *  based on the ratio of the scaling factors.  If SCOND < THRESH,
00066 *  scaling is done.
00067 *
00068 *  LARGE and SMALL are threshold values used to decide if scaling should
00069 *  be done based on the absolute size of the largest matrix element.
00070 *  If AMAX > LARGE or AMAX < SMALL, scaling is done.
00071 *
00072 *  =====================================================================
00073 *
00074 *     .. Parameters ..
00075       REAL               ONE, THRESH
00076       PARAMETER          ( ONE = 1.0E+0, THRESH = 0.1E+0 )
00077 *     ..
00078 *     .. Local Scalars ..
00079       INTEGER            I, J, JC
00080       REAL               CJ, LARGE, SMALL
00081 *     ..
00082 *     .. External Functions ..
00083       LOGICAL            LSAME
00084       REAL               SLAMCH
00085       EXTERNAL           LSAME, SLAMCH
00086 *     ..
00087 *     .. Executable Statements ..
00088 *
00089 *     Quick return if possible
00090 *
00091       IF( N.LE.0 ) THEN
00092          EQUED = 'N'
00093          RETURN
00094       END IF
00095 *
00096 *     Initialize LARGE and SMALL.
00097 *
00098       SMALL = SLAMCH( 'Safe minimum' ) / SLAMCH( 'Precision' )
00099       LARGE = ONE / SMALL
00100 *
00101       IF( SCOND.GE.THRESH .AND. AMAX.GE.SMALL .AND. AMAX.LE.LARGE ) THEN
00102 *
00103 *        No equilibration
00104 *
00105          EQUED = 'N'
00106       ELSE
00107 *
00108 *        Replace A by diag(S) * A * diag(S).
00109 *
00110          IF( LSAME( UPLO, 'U' ) ) THEN
00111 *
00112 *           Upper triangle of A is stored.
00113 *
00114             JC = 1
00115             DO 20 J = 1, N
00116                CJ = S( J )
00117                DO 10 I = 1, J
00118                   AP( JC+I-1 ) = CJ*S( I )*AP( JC+I-1 )
00119    10          CONTINUE
00120                JC = JC + J
00121    20       CONTINUE
00122          ELSE
00123 *
00124 *           Lower triangle of A is stored.
00125 *
00126             JC = 1
00127             DO 40 J = 1, N
00128                CJ = S( J )
00129                DO 30 I = J, N
00130                   AP( JC+I-J ) = CJ*S( I )*AP( JC+I-J )
00131    30          CONTINUE
00132                JC = JC + N - J + 1
00133    40       CONTINUE
00134          END IF
00135          EQUED = 'Y'
00136       END IF
00137 *
00138       RETURN
00139 *
00140 *     End of CLAQSP
00141 *
00142       END
 All Files Functions