cdbtf2(3s) CDBTF2 - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting with row interchanges SUBROUTINE CDBTF2( M, N, KL, KU, AB, LDAB, INFO ) INTEGER INFO, KL, KU, LDAB, M, N COMPLEX AB( LDAB, * ) Cdbtrf computes an LU factorization of a real m-by-n ...

cdbtrf(3s) CDBTRF - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting or row interchanges SUBROUTINE CDBTRF( M, N, KL, KU, AB, LDAB, INFO ) INTEGER INFO, KL, KU, LDAB, M, N COMPLEX AB( LDAB, * ) Cdbtrf computes an LU factorization of a real m-by-n ...

cdttrf(3s) CDTTRF - compute an LU factorization of a complex tridiagonal ma­ trix A using elimination without partial pivoting SUBROUTINE CDT­ TRF( N, DL, D, DU, INFO ) INTEGER INFO, N COMPLEX D( * ), DL( * ), DU( * ) CDTTRF computes an LU fac­ torization of a complex tridiagonal matrix ...

cdttrsv(3s) CDTTRSV - solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B, SUBROUTINE CDTTRSV( UPLO, TRANS, N, NRHS, DL, D, DU, B, LDB, INFO ) CHARACTER UPLO, TRANS INTEGER INFO, LDB, N, NRHS COMPLEX B( LDB, * ), D( * ), DL( * ), DU( * ) CDTTRSV solves one of ...

clahqr2(3s) CLAHQR2(l) ) CLAHQR2(l) NAME CLAHQR2 - i an auxiliary routine called by CHSEQR to update the eigenvalues and Schur decomposition already computed by CHSEQR, by dealing with the Hessenberg subma­ trix in ...

clamsh(3s) CLAMSH(l) ) CLAMSH(l) NAME CLAMSH - send multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal ele­ ments are modified by subsequent shifts in an effort to maximize the ...

clanv2(3s) CLANV2(l) ) CLANV2(l) NAME CLANV2 - compute the Schur factorization of a complex 2-by-2 nonhermitian matrix in standard form SYNOPSIS SUBROUTINE CLANV2( A, B, C, D, RT1, RT2, CS, SN ) REAL CS ...

claref(3s) CLAREF(l) ) CLAREF(l) NAME CLAREF - applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns SYNOPSIS SUBROUTINE CLAREF( TYPE, A, ...

cpttrsv(3s) CPTTRSV - solve one of the triangular systems L * X = B, or L**H * X = B, SUBROUTINE CPTTRSV( UPLO, TRANS, N, NRHS, D, E, B, LDB, INFO ) CHARACTER UPLO, TRANS INTEGER INFO, LDB, N, NRHS REAL D( * ) COMPLEX B( LDB, * ), E( * ) CPTTRSV solves one of the trian­ gular ...

csteqr2(3s) CSTEQR2(l) ) CSTEQR2(l) NAME CSTEQR2 - i a modified version of LAPACK routine CSTEQR SYNOPSIS SUBROUTINE CSTEQR2( COMPZ, N, D, E, Z, LDZ, NR, WORK, INFO ) CHARACTER COMPZ ...

ctrmvt(3s) CTRMVT(l) ) CTRMVT(l) NAME CTRMVT - perform the matrix-vector operations x := conjg( T' ) *y, and w := T *z, SYNOPSIS SUBROUTINE CTRMVT( UPLO, N, T, LDT, X, INCX, Y, INCY, W, INCW, Z, INCZ ) ...

ddbtf2(3s) DDBTF2 - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting with row interchanges SUBROUTINE DDBTF2( M, N, KL, KU, AB, LDAB, INFO ) INTEGER INFO, KL, KU, LDAB, M, N DOUBLE PRECISION AB( LDAB, * ) Ddbtrf computes an LU factor­ ization of a ...

ddbtrf(3s) DDBTRF - compute an LU factorization of a real m-by-n band matrix A without using partial pivoting or row interchanges SUBROUTINE DDBTRF( M, N, KL, KU, AB, LDAB, INFO ) INTEGER INFO, KL, KU, LDAB, M, N DOUBLE PRECISION AB( LDAB, * ) Ddbtrf computes an LU factor­ ization of a ...

ddttrf(3s) DDTTRF - compute an LU factorization of a complex tridiagonal ma­ trix A using elimination without partial pivoting SUBROUTINE DDT­ TRF( N, DL, D, DU, INFO ) INTEGER INFO, N DOUBLE PRECISION D( * ), DL( * ), DU( * ) DDTTRF computes an LU factorization of a complex tridiagonal ...

ddttrsv(3s) DDTTRSV - solve one of the systems of equations L * X = B, L**T * X = B, or L**H * X = B, SUBROUTINE DDTTRSV( UPLO, TRANS, N, NRHS, DL, D, DU, B, LDB, INFO ) CHARACTER UPLO, TRANS INTEGER INFO, LDB, N, NRHS DOUBLE PRECISION B( LDB, * ), D( * ), DL( * ), DU( * ) DDT­ TRSV ...

dlamsh(3s) DLAMSH(l) ) DLAMSH(l) NAME DLAMSH - send multiple shifts through a small (single node) matrix to see how consecutive small subdiagonal ele­ ments are modified by subsequent shifts in an effort to maximize the ...

dlapst(3s) DLAPST(l) ) DLAPST(l) NAME DLAPST - Define a permutation INDX that sorts the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ) SYNOPSIS SUBROUTINE DLAPST( ID, N, D, INDX, INFO ) ...

dlaref(3s) DLAREF(l) ) DLAREF(l) NAME DLAREF - applie one or several Householder reflectors of size 3 to one or two matrices (if column is specified) on either their rows or columns SYNOPSIS SUBROUTINE DLAREF( TYPE, A, ...

dlasorte(3s) DLASORTE(l) ) DLASORTE(l) NAME DLASORTE - sort eigenpairs so that real eigenpairs are together and complex are together SYNOPSIS SUBROUTINE DLASORTE( S, LDS, J, OUT, INFO ) INTEGER INFO, J, LDS ...

dlasrt2(3s) DLASRT2(l) ) DLASRT2(l) NAME DLASRT2 - the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ) SYNOPSIS SUBROUTINE DLASRT2( ID, N, D, KEY, INFO ) CHARACTER ID ...