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.
194 lines
5.5 KiB
194 lines
5.5 KiB
*> \brief \b ZERLQT
|
|
*
|
|
* =========== DOCUMENTATION ===========
|
|
*
|
|
* Online html documentation available at
|
|
* http://www.netlib.org/lapack/explore-html/
|
|
*
|
|
* Definition:
|
|
* ===========
|
|
*
|
|
* SUBROUTINE ZERRLQT( PATH, NUNIT )
|
|
*
|
|
* .. Scalar Arguments ..
|
|
* CHARACTER*3 PATH
|
|
* INTEGER NUNIT
|
|
* ..
|
|
*
|
|
*
|
|
*> \par Purpose:
|
|
* =============
|
|
*>
|
|
*> \verbatim
|
|
*>
|
|
*> ZERRLQT tests the error exits for the COMPLEX routines
|
|
*> that use the LQT decomposition of a general matrix.
|
|
*> \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 double_lin
|
|
*
|
|
* =====================================================================
|
|
SUBROUTINE ZERRLQT( PATH, NUNIT )
|
|
IMPLICIT NONE
|
|
*
|
|
* -- 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 = 2 )
|
|
* ..
|
|
* .. Local Scalars ..
|
|
INTEGER I, INFO, J
|
|
* ..
|
|
* .. Local Arrays ..
|
|
COMPLEX*16 A( NMAX, NMAX ), T( NMAX, NMAX ), W( NMAX ),
|
|
$ C( NMAX, NMAX )
|
|
* ..
|
|
* .. External Subroutines ..
|
|
EXTERNAL ALAESM, CHKXER, ZGELQT3, ZGELQT,
|
|
$ ZGEMLQT
|
|
* ..
|
|
* .. 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 DBLE, DCMPLX
|
|
* ..
|
|
* .. Executable Statements ..
|
|
*
|
|
NOUT = NUNIT
|
|
WRITE( NOUT, FMT = * )
|
|
*
|
|
* Set the variables to innocuous values.
|
|
*
|
|
DO J = 1, NMAX
|
|
DO I = 1, NMAX
|
|
A( I, J ) = 1.D0 / DCMPLX( DBLE( I+J ), 0.D0 )
|
|
C( I, J ) = 1.D0 / DCMPLX( DBLE( I+J ), 0.D0 )
|
|
T( I, J ) = 1.D0 / DCMPLX( DBLE( I+J ), 0.D0 )
|
|
END DO
|
|
W( J ) = 0.D0
|
|
END DO
|
|
OK = .TRUE.
|
|
*
|
|
* Error exits for LQT factorization
|
|
*
|
|
* ZGELQT
|
|
*
|
|
SRNAMT = 'ZGELQT'
|
|
INFOT = 1
|
|
CALL ZGELQT( -1, 0, 1, A, 1, T, 1, W, INFO )
|
|
CALL CHKXER( 'ZGELQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 2
|
|
CALL ZGELQT( 0, -1, 1, A, 1, T, 1, W, INFO )
|
|
CALL CHKXER( 'ZGELQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 3
|
|
CALL ZGELQT( 0, 0, 0, A, 1, T, 1, W, INFO )
|
|
CALL CHKXER( 'ZGELQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 5
|
|
CALL ZGELQT( 2, 1, 1, A, 1, T, 1, W, INFO )
|
|
CALL CHKXER( 'ZGELQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 7
|
|
CALL ZGELQT( 2, 2, 2, A, 2, T, 1, W, INFO )
|
|
CALL CHKXER( 'ZGELQT', INFOT, NOUT, LERR, OK )
|
|
*
|
|
* ZGELQT3
|
|
*
|
|
SRNAMT = 'ZGELQT3'
|
|
INFOT = 1
|
|
CALL ZGELQT3( -1, 0, A, 1, T, 1, INFO )
|
|
CALL CHKXER( 'ZGELQT3', INFOT, NOUT, LERR, OK )
|
|
INFOT = 2
|
|
CALL ZGELQT3( 0, -1, A, 1, T, 1, INFO )
|
|
CALL CHKXER( 'ZGELQT3', INFOT, NOUT, LERR, OK )
|
|
INFOT = 4
|
|
CALL ZGELQT3( 2, 2, A, 1, T, 1, INFO )
|
|
CALL CHKXER( 'ZGELQT3', INFOT, NOUT, LERR, OK )
|
|
INFOT = 6
|
|
CALL ZGELQT3( 2, 2, A, 2, T, 1, INFO )
|
|
CALL CHKXER( 'ZGELQT3', INFOT, NOUT, LERR, OK )
|
|
*
|
|
* ZGEMLQT
|
|
*
|
|
SRNAMT = 'ZGEMLQT'
|
|
INFOT = 1
|
|
CALL ZGEMLQT( '/', 'N', 0, 0, 0, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 2
|
|
CALL ZGEMLQT( 'L', '/', 0, 0, 0, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 3
|
|
CALL ZGEMLQT( 'L', 'N', -1, 0, 0, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 4
|
|
CALL ZGEMLQT( 'L', 'N', 0, -1, 0, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 5
|
|
CALL ZGEMLQT( 'L', 'N', 0, 0, -1, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 5
|
|
CALL ZGEMLQT( 'R', 'N', 0, 0, -1, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 6
|
|
CALL ZGEMLQT( 'L', 'N', 0, 0, 0, 0, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 8
|
|
CALL ZGEMLQT( 'R', 'N', 2, 2, 2, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 8
|
|
CALL ZGEMLQT( 'L', 'N', 2, 2, 2, 1, A, 1, T, 1, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 10
|
|
CALL ZGEMLQT( 'R', 'N', 1, 1, 1, 1, A, 1, T, 0, C, 1, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
INFOT = 12
|
|
CALL ZGEMLQT( 'L', 'N', 1, 1, 1, 1, A, 1, T, 1, C, 0, W, INFO )
|
|
CALL CHKXER( 'ZGEMLQT', INFOT, NOUT, LERR, OK )
|
|
*
|
|
* Print a summary line.
|
|
*
|
|
CALL ALAESM( PATH, OK, NOUT )
|
|
*
|
|
RETURN
|
|
*
|
|
* End of ZERRLQT
|
|
*
|
|
END
|
|
|