Cloned library LAPACK-3.11.0 with extra build files for internal package management.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

406 lines
13 KiB

*> \brief \b CERRGE
*
* =========== DOCUMENTATION ===========
*
* Online html documentation available at
* http://www.netlib.org/lapack/explore-html/
*
* Definition:
* ===========
*
* SUBROUTINE CERRGE( PATH, NUNIT )
*
* .. Scalar Arguments ..
* CHARACTER*3 PATH
* INTEGER NUNIT
* ..
*
*
*> \par Purpose:
* =============
*>
*> \verbatim
*>
*> CERRGE tests the error exits for the COMPLEX routines
*> for general matrices.
*> \endverbatim
*
* Arguments:
* ==========
*
*> \param[in] PATH
*> \verbatim
*> PATH is CHARACTER*3
*> The LAPACK path name for the routines to be tested.
*> \endverbatim
*>
*> \param[in] NUNIT
*> \verbatim
*> NUNIT is INTEGER
*> The unit number for output.
*> \endverbatim
*
* Authors:
* ========
*
*> \author Univ. of Tennessee
*> \author Univ. of California Berkeley
*> \author Univ. of Colorado Denver
*> \author NAG Ltd.
*
*> \ingroup complex_lin
*
* =====================================================================
SUBROUTINE CERRGE( PATH, NUNIT )
*
* -- LAPACK test 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*3 PATH
INTEGER NUNIT
* ..
*
* =====================================================================
*
* .. Parameters ..
INTEGER NMAX
PARAMETER ( NMAX = 4 )
* ..
* .. Local Scalars ..
CHARACTER*2 C2
INTEGER I, INFO, J
REAL ANRM, CCOND, RCOND
* ..
* .. Local Arrays ..
INTEGER IP( NMAX )
REAL R( NMAX ), R1( NMAX ), R2( NMAX )
COMPLEX A( NMAX, NMAX ), AF( NMAX, NMAX ), B( NMAX ),
$ W( 2*NMAX ), X( NMAX )
* ..
* .. External Functions ..
LOGICAL LSAMEN
EXTERNAL LSAMEN
* ..
* .. External Subroutines ..
EXTERNAL ALAESM, CGBCON, CGBEQU, CGBRFS, CGBTF2, CGBTRF,
$ CGBTRS, CGECON, CGEEQU, CGERFS, CGETF2, CGETRF,
$ CGETRI, CGETRS, CHKXER
* ..
* .. Scalars in Common ..
LOGICAL LERR, OK
CHARACTER*32 SRNAMT
INTEGER INFOT, NOUT
* ..
* .. Common blocks ..
COMMON / INFOC / INFOT, NOUT, OK, LERR
COMMON / SRNAMC / SRNAMT
* ..
* .. Intrinsic Functions ..
INTRINSIC CMPLX, REAL
* ..
* .. Executable Statements ..
*
NOUT = NUNIT
WRITE( NOUT, FMT = * )
C2 = PATH( 2: 3 )
*
* Set the variables to innocuous values.
*
DO 20 J = 1, NMAX
DO 10 I = 1, NMAX
A( I, J ) = CMPLX( 1. / REAL( I+J ), -1. / REAL( I+J ) )
AF( I, J ) = CMPLX( 1. / REAL( I+J ), -1. / REAL( I+J ) )
10 CONTINUE
B( J ) = 0.
R1( J ) = 0.
R2( J ) = 0.
W( J ) = 0.
X( J ) = 0.
IP( J ) = J
20 CONTINUE
OK = .TRUE.
*
* Test error exits of the routines that use the LU decomposition
* of a general matrix.
*
IF( LSAMEN( 2, C2, 'GE' ) ) THEN
*
* CGETRF
*
SRNAMT = 'CGETRF'
INFOT = 1
CALL CGETRF( -1, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGETRF', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGETRF( 0, -1, A, 1, IP, INFO )
CALL CHKXER( 'CGETRF', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGETRF( 2, 1, A, 1, IP, INFO )
CALL CHKXER( 'CGETRF', INFOT, NOUT, LERR, OK )
*
* CGETF2
*
SRNAMT = 'CGETF2'
INFOT = 1
CALL CGETF2( -1, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGETF2', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGETF2( 0, -1, A, 1, IP, INFO )
CALL CHKXER( 'CGETF2', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGETF2( 2, 1, A, 1, IP, INFO )
CALL CHKXER( 'CGETF2', INFOT, NOUT, LERR, OK )
*
* CGETRI
*
SRNAMT = 'CGETRI'
INFOT = 1
CALL CGETRI( -1, A, 1, IP, W, 1, INFO )
CALL CHKXER( 'CGETRI', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGETRI( 2, A, 1, IP, W, 2, INFO )
CALL CHKXER( 'CGETRI', INFOT, NOUT, LERR, OK )
INFOT = 6
CALL CGETRI( 2, A, 2, IP, W, 1, INFO )
CALL CHKXER( 'CGETRI', INFOT, NOUT, LERR, OK )
*
* CGETRS
*
SRNAMT = 'CGETRS'
INFOT = 1
CALL CGETRS( '/', 0, 0, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGETRS', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGETRS( 'N', -1, 0, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGETRS', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGETRS( 'N', 0, -1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGETRS', INFOT, NOUT, LERR, OK )
INFOT = 5
CALL CGETRS( 'N', 2, 1, A, 1, IP, B, 2, INFO )
CALL CHKXER( 'CGETRS', INFOT, NOUT, LERR, OK )
INFOT = 8
CALL CGETRS( 'N', 2, 1, A, 2, IP, B, 1, INFO )
CALL CHKXER( 'CGETRS', INFOT, NOUT, LERR, OK )
*
* CGERFS
*
SRNAMT = 'CGERFS'
INFOT = 1
CALL CGERFS( '/', 0, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1, R2, W,
$ R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGERFS( 'N', -1, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1, R2,
$ W, R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGERFS( 'N', 0, -1, A, 1, AF, 1, IP, B, 1, X, 1, R1, R2,
$ W, R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
INFOT = 5
CALL CGERFS( 'N', 2, 1, A, 1, AF, 2, IP, B, 2, X, 2, R1, R2, W,
$ R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
INFOT = 7
CALL CGERFS( 'N', 2, 1, A, 2, AF, 1, IP, B, 2, X, 2, R1, R2, W,
$ R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
INFOT = 10
CALL CGERFS( 'N', 2, 1, A, 2, AF, 2, IP, B, 1, X, 2, R1, R2, W,
$ R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
INFOT = 12
CALL CGERFS( 'N', 2, 1, A, 2, AF, 2, IP, B, 2, X, 1, R1, R2, W,
$ R, INFO )
CALL CHKXER( 'CGERFS', INFOT, NOUT, LERR, OK )
*
* CGECON
*
SRNAMT = 'CGECON'
INFOT = 1
CALL CGECON( '/', 0, A, 1, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGECON', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGECON( '1', -1, A, 1, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGECON', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGECON( '1', 2, A, 1, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGECON', INFOT, NOUT, LERR, OK )
*
* CGEEQU
*
SRNAMT = 'CGEEQU'
INFOT = 1
CALL CGEEQU( -1, 0, A, 1, R1, R2, RCOND, CCOND, ANRM, INFO )
CALL CHKXER( 'CGEEQU', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGEEQU( 0, -1, A, 1, R1, R2, RCOND, CCOND, ANRM, INFO )
CALL CHKXER( 'CGEEQU', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGEEQU( 2, 2, A, 1, R1, R2, RCOND, CCOND, ANRM, INFO )
CALL CHKXER( 'CGEEQU', INFOT, NOUT, LERR, OK )
*
* Test error exits of the routines that use the LU decomposition
* of a general band matrix.
*
ELSE IF( LSAMEN( 2, C2, 'GB' ) ) THEN
*
* CGBTRF
*
SRNAMT = 'CGBTRF'
INFOT = 1
CALL CGBTRF( -1, 0, 0, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGBTRF', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGBTRF( 0, -1, 0, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGBTRF', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGBTRF( 1, 1, -1, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGBTRF', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGBTRF( 1, 1, 0, -1, A, 1, IP, INFO )
CALL CHKXER( 'CGBTRF', INFOT, NOUT, LERR, OK )
INFOT = 6
CALL CGBTRF( 2, 2, 1, 1, A, 3, IP, INFO )
CALL CHKXER( 'CGBTRF', INFOT, NOUT, LERR, OK )
*
* CGBTF2
*
SRNAMT = 'CGBTF2'
INFOT = 1
CALL CGBTF2( -1, 0, 0, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGBTF2', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGBTF2( 0, -1, 0, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGBTF2', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGBTF2( 1, 1, -1, 0, A, 1, IP, INFO )
CALL CHKXER( 'CGBTF2', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGBTF2( 1, 1, 0, -1, A, 1, IP, INFO )
CALL CHKXER( 'CGBTF2', INFOT, NOUT, LERR, OK )
INFOT = 6
CALL CGBTF2( 2, 2, 1, 1, A, 3, IP, INFO )
CALL CHKXER( 'CGBTF2', INFOT, NOUT, LERR, OK )
*
* CGBTRS
*
SRNAMT = 'CGBTRS'
INFOT = 1
CALL CGBTRS( '/', 0, 0, 0, 1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGBTRS( 'N', -1, 0, 0, 1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGBTRS( 'N', 1, -1, 0, 1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGBTRS( 'N', 1, 0, -1, 1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
INFOT = 5
CALL CGBTRS( 'N', 1, 0, 0, -1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
INFOT = 7
CALL CGBTRS( 'N', 2, 1, 1, 1, A, 3, IP, B, 2, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
INFOT = 10
CALL CGBTRS( 'N', 2, 0, 0, 1, A, 1, IP, B, 1, INFO )
CALL CHKXER( 'CGBTRS', INFOT, NOUT, LERR, OK )
*
* CGBRFS
*
SRNAMT = 'CGBRFS'
INFOT = 1
CALL CGBRFS( '/', 0, 0, 0, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGBRFS( 'N', -1, 0, 0, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGBRFS( 'N', 1, -1, 0, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGBRFS( 'N', 1, 0, -1, 0, A, 1, AF, 1, IP, B, 1, X, 1, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 5
CALL CGBRFS( 'N', 1, 0, 0, -1, A, 1, AF, 1, IP, B, 1, X, 1, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 7
CALL CGBRFS( 'N', 2, 1, 1, 1, A, 2, AF, 4, IP, B, 2, X, 2, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 9
CALL CGBRFS( 'N', 2, 1, 1, 1, A, 3, AF, 3, IP, B, 2, X, 2, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 12
CALL CGBRFS( 'N', 2, 0, 0, 1, A, 1, AF, 1, IP, B, 1, X, 2, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
INFOT = 14
CALL CGBRFS( 'N', 2, 0, 0, 1, A, 1, AF, 1, IP, B, 2, X, 1, R1,
$ R2, W, R, INFO )
CALL CHKXER( 'CGBRFS', INFOT, NOUT, LERR, OK )
*
* CGBCON
*
SRNAMT = 'CGBCON'
INFOT = 1
CALL CGBCON( '/', 0, 0, 0, A, 1, IP, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGBCON', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGBCON( '1', -1, 0, 0, A, 1, IP, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGBCON', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGBCON( '1', 1, -1, 0, A, 1, IP, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGBCON', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGBCON( '1', 1, 0, -1, A, 1, IP, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGBCON', INFOT, NOUT, LERR, OK )
INFOT = 6
CALL CGBCON( '1', 2, 1, 1, A, 3, IP, ANRM, RCOND, W, R, INFO )
CALL CHKXER( 'CGBCON', INFOT, NOUT, LERR, OK )
*
* CGBEQU
*
SRNAMT = 'CGBEQU'
INFOT = 1
CALL CGBEQU( -1, 0, 0, 0, A, 1, R1, R2, RCOND, CCOND, ANRM,
$ INFO )
CALL CHKXER( 'CGBEQU', INFOT, NOUT, LERR, OK )
INFOT = 2
CALL CGBEQU( 0, -1, 0, 0, A, 1, R1, R2, RCOND, CCOND, ANRM,
$ INFO )
CALL CHKXER( 'CGBEQU', INFOT, NOUT, LERR, OK )
INFOT = 3
CALL CGBEQU( 1, 1, -1, 0, A, 1, R1, R2, RCOND, CCOND, ANRM,
$ INFO )
CALL CHKXER( 'CGBEQU', INFOT, NOUT, LERR, OK )
INFOT = 4
CALL CGBEQU( 1, 1, 0, -1, A, 1, R1, R2, RCOND, CCOND, ANRM,
$ INFO )
CALL CHKXER( 'CGBEQU', INFOT, NOUT, LERR, OK )
INFOT = 6
CALL CGBEQU( 2, 2, 1, 1, A, 2, R1, R2, RCOND, CCOND, ANRM,
$ INFO )
CALL CHKXER( 'CGBEQU', INFOT, NOUT, LERR, OK )
END IF
*
* Print a summary line.
*
CALL ALAESM( PATH, OK, NOUT )
*
RETURN
*
* End of CERRGE
*
END