cla__hercond__c_8f_source.html

*> \brief \b CLA_HERCOND_C computes the infinity norm condition number of op(A)*inv(diag(c)) for Hermitian indefinite matrices.

*

*  =========== DOCUMENTATION ===========

*

* Online html documentation available at

*            http://www.netlib.org/lapack/explore-html/

*

*> \htmlonly

*> Download CLA_HERCOND_C + dependencies

*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/cla_hercond_c.f">

*> [TGZ]</a>

*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/cla_hercond_c.f">

*> [ZIP]</a>

*> <a href="http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/cla_hercond_c.f">

*> [TXT]</a>

*> \endhtmlonly

*

*  Definition:

*  ===========

*

*       REAL FUNCTION CLA_HERCOND_C( UPLO, N, A, LDA, AF, LDAF, IPIV, C,

*                                    CAPPLY, INFO, WORK, RWORK )

*

*       .. Scalar Arguments ..

*       CHARACTER          UPLO

*       LOGICAL            CAPPLY

*       INTEGER            N, LDA, LDAF, INFO

*       ..

*       .. Array Arguments ..

*       INTEGER            IPIV( * )

*       COMPLEX            A( LDA, * ), AF( LDAF, * ), WORK( * )

*       REAL               C ( * ), RWORK( * )

*       ..

*

*

*> \par Purpose:

*  =============

*>

*> \verbatim

*>

*>    CLA_HERCOND_C computes the infinity norm condition number of

*>    op(A) * inv(diag(C)) where C is a REAL vector.

*> \endverbatim

*

*  Arguments:

*  ==========

*

*> \param[in] UPLO

*> \verbatim

*>          UPLO is CHARACTER*1

*>       = 'U':  Upper triangle of A is stored;

*>       = 'L':  Lower triangle of A is stored.

*> \endverbatim

*>

*> \param[in] N

*> \verbatim

*>          N is INTEGER

*>     The number of linear equations, i.e., the order of the

*>     matrix A.  N >= 0.

*> \endverbatim

*>

*> \param[in] A

*> \verbatim

*>          A is COMPLEX array, dimension (LDA,N)

*>     On entry, the N-by-N matrix A

*> \endverbatim

*>

*> \param[in] LDA

*> \verbatim

*>          LDA is INTEGER

*>     The leading dimension of the array A.  LDA >= max(1,N).

*> \endverbatim

*>

*> \param[in] AF

*> \verbatim

*>          AF is COMPLEX array, dimension (LDAF,N)

*>     The block diagonal matrix D and the multipliers used to

*>     obtain the factor U or L as computed by CHETRF.

*> \endverbatim

*>

*> \param[in] LDAF

*> \verbatim

*>          LDAF is INTEGER

*>     The leading dimension of the array AF.  LDAF >= max(1,N).

*> \endverbatim

*>

*> \param[in] IPIV

*> \verbatim

*>          IPIV is INTEGER array, dimension (N)

*>     Details of the interchanges and the block structure of D

*>     as determined by CHETRF.

*> \endverbatim

*>

*> \param[in] C

*> \verbatim

*>          C is REAL array, dimension (N)

*>     The vector C in the formula op(A) * inv(diag(C)).

*> \endverbatim

*>

*> \param[in] CAPPLY

*> \verbatim

*>          CAPPLY is LOGICAL

*>     If .TRUE. then access the vector C in the formula above.

*> \endverbatim

*>

*> \param[out] INFO

*> \verbatim

*>          INFO is INTEGER

*>       = 0:  Successful exit.

*>     i > 0:  The ith argument is invalid.

*> \endverbatim

*>

*> \param[out] WORK

*> \verbatim

*>          WORK is COMPLEX array, dimension (2*N).

*>     Workspace.

*> \endverbatim

*>

*> \param[out] RWORK

*> \verbatim

*>          RWORK is REAL array, dimension (N).

*>     Workspace.

*> \endverbatim

*

*  Authors:

*  ========

*

*> \author Univ. of Tennessee

*> \author Univ. of California Berkeley

*> \author Univ. of Colorado Denver

*> \author NAG Ltd.

*

*> \ingroup complexHEcomputational

*

*  =====================================================================


      REAL function cla_hercond_c( uplo, n, a, lda, af, ldaf, ipiv, c,

     $                             capply, info, work, rwork )

*

*  -- LAPACK computational routine --

*  -- LAPACK is a software package provided by Univ. of Tennessee,    --

*  -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--

*

*     .. Scalar Arguments ..

      CHARACTER          uplo

      LOGICAL            capply

      INTEGER            n, lda, ldaf, info

*     ..

*     .. Array Arguments ..

      INTEGER            ipiv( * )

      COMPLEX            a( lda, * ), af( ldaf, * ), work( * )

      REAL               c ( * ), rwork( * )

*     ..

*

*  =====================================================================

*

*     .. Local Scalars ..

      INTEGER            kase, i, j

      REAL               ainvnm, anorm, tmp

      LOGICAL            up, upper

      COMPLEX            zdum

*     ..

*     .. Local Arrays ..

      INTEGER            isave( 3 )

*     ..

*     .. External Functions ..

      LOGICAL            lsame

      EXTERNAL           lsame

*     ..

*     .. External Subroutines ..

      EXTERNAL           clacn2, chetrs, xerbla

*     ..

*     .. Intrinsic Functions ..

      INTRINSIC          abs, max

*     ..

*     .. Statement Functions ..

      REAL               cabs1

*     ..

*     .. Statement Function Definitions ..

      cabs1( zdum ) = abs( real( zdum ) ) + abs( aimag( zdum ) )

*     ..

*     .. Executable Statements ..

*

      cla_hercond_c = 0.0e+0

*

      info = 0

      upper = lsame( uplo, 'U' )

      IF( .NOT.upper .AND. .NOT.lsame( uplo, 'L' ) ) THEN

         info = -1

      ELSE IF( n.LT.0 ) THEN

         info = -2

      ELSE IF( lda.LT.max( 1, n ) ) THEN

         info = -4

      ELSE IF( ldaf.LT.max( 1, n ) ) THEN

         info = -6

      END IF

      IF( info.NE.0 ) THEN

         CALL xerbla( 'cla_hercond_c', -INFO )

         RETURN

      END IF

      UP = .FALSE.

      IF ( LSAME( UPLO, 'u' ) ) UP = .TRUE.

*

*     Compute norm of op(A)*op2(C).

*

      ANORM = 0.0E+0

      IF ( UP ) THEN

         DO I = 1, N

            TMP = 0.0E+0

            IF ( CAPPLY ) THEN

               DO J = 1, I

                  TMP = TMP + CABS1( A( J, I ) ) / C( J )

               END DO

               DO J = I+1, N

                  TMP = TMP + CABS1( A( I, J ) ) / C( J )

               END DO

            ELSE

               DO J = 1, I

                  TMP = TMP + CABS1( A( J, I ) )

               END DO

               DO J = I+1, N

                  TMP = TMP + CABS1( A( I, J ) )

               END DO

            END IF

            RWORK( I ) = TMP

            ANORM = MAX( ANORM, TMP )

         END DO

      ELSE

         DO I = 1, N

            TMP = 0.0E+0

            IF ( CAPPLY ) THEN

               DO J = 1, I

                  TMP = TMP + CABS1( A( I, J ) ) / C( J )

               END DO

               DO J = I+1, N

                  TMP = TMP + CABS1( A( J, I ) ) / C( J )

               END DO

            ELSE

               DO J = 1, I

                  TMP = TMP + CABS1( A( I, J ) )

               END DO

               DO J = I+1, N

                  TMP = TMP + CABS1( A( J, I ) )

               END DO

            END IF

            RWORK( I ) = TMP

            ANORM = MAX( ANORM, TMP )

         END DO

      END IF

*

*     Quick return if possible.

*

.EQ.      IF( N0 ) THEN

         CLA_HERCOND_C = 1.0E+0

         RETURN

.EQ.      ELSE IF( ANORM  0.0E+0 ) THEN

         RETURN

      END IF

*

*     Estimate the norm of inv(op(A)).

*

      AINVNM = 0.0E+0

*

      KASE = 0

   10 CONTINUE

      CALL CLACN2( N, WORK( N+1 ), WORK, AINVNM, KASE, ISAVE )

.NE.      IF( KASE0 ) THEN

.EQ.         IF( KASE2 ) THEN

*

*           Multiply by R.

*

            DO I = 1, N

               WORK( I ) = WORK( I ) * RWORK( I )

            END DO

*

            IF ( UP ) THEN

               CALL CHETRS( 'u', N, 1, AF, LDAF, IPIV,

     $            WORK, N, INFO )

            ELSE

               CALL CHETRS( 'l', N, 1, AF, LDAF, IPIV,

     $            WORK, N, INFO )

            ENDIF

*

*           Multiply by inv(C).

*

            IF ( CAPPLY ) THEN

               DO I = 1, N

                  WORK( I ) = WORK( I ) * C( I )

               END DO

            END IF

         ELSE

*

*           Multiply by inv(C**H).

*

            IF ( CAPPLY ) THEN

               DO I = 1, N

                  WORK( I ) = WORK( I ) * C( I )

               END DO

            END IF

*

            IF ( UP ) THEN

               CALL CHETRS( 'u', N, 1, AF, LDAF, IPIV,

     $            WORK, N, INFO )

            ELSE

               CALL CHETRS( 'l', N, 1, AF, LDAF, IPIV,

     $            WORK, N, INFO )

            END IF

*

*           Multiply by R.

*

            DO I = 1, N

               WORK( I ) = WORK( I ) * RWORK( I )

            END DO

         END IF

         GO TO 10

      END IF

*

*     Compute the estimate of the reciprocal condition number.

*

.NE.      IF( AINVNM  0.0E+0 )

     $   CLA_HERCOND_C = 1.0E+0 / AINVNM

*

      RETURN

*

*     End of CLA_HERCOND_C

*


      END

xerbla
subroutine xerbla(srname, info)
XERBLA
Definition xerbla.f:60

lsame
logical function lsame(ca, cb)
LSAME
Definition lsame.f:53

chetrs
subroutine chetrs(uplo, n, nrhs, a, lda, ipiv, b, ldb, info)
CHETRS
Definition chetrs.f:120

cla_hercond_c
real function cla_hercond_c(uplo, n, a, lda, af, ldaf, ipiv, c, capply, info, work, rwork)
CLA_HERCOND_C computes the infinity norm condition number of op(A)*inv(diag(c)) for Hermitian indefin...
Definition cla_hercond_c.f:138

clacn2
subroutine clacn2(n, v, x, est, kase, isave)
CLACN2 estimates the 1-norm of a square matrix, using reverse communication for evaluating matrix-vec...
Definition clacn2.f:133

max
#define max(a, b)
Definition macros.h:21