ZLSETS tests ZGGLSE - a subroutine for solving linear equality
 constrained least square problem (LSE).

M

          M is INTEGER
          The number of rows of the matrix A.  M >= 0.

P

          P is INTEGER
          The number of rows of the matrix B.  P >= 0.

N

          N is INTEGER
          The number of columns of the matrices A and B.  N >= 0.

A

          A is COMPLEX*16 array, dimension (LDA,N)
          The M-by-N matrix A.

AF

          AF is COMPLEX*16 array, dimension (LDA,N)

LDA

          LDA is INTEGER
          The leading dimension of the arrays A, AF, Q and R.
          LDA >= max(M,N).

B

          B is COMPLEX*16 array, dimension (LDB,N)
          The P-by-N matrix A.

BF

          BF is COMPLEX*16 array, dimension (LDB,N)

LDB

          LDB is INTEGER
          The leading dimension of the arrays B, BF, V and S.
          LDB >= max(P,N).

C

          C is COMPLEX*16 array, dimension( M )
          the vector C in the LSE problem.

CF

          CF is COMPLEX*16 array, dimension( M )

D

          D is COMPLEX*16 array, dimension( P )
          the vector D in the LSE problem.

DF

          DF is COMPLEX*16 array, dimension( P )

X

          X is COMPLEX*16 array, dimension( N )
          solution vector X in the LSE problem.

WORK

          WORK is COMPLEX*16 array, dimension (LWORK)

LWORK

          LWORK is INTEGER
          The dimension of the array WORK.

RWORK

          RWORK is DOUBLE PRECISION array, dimension (M)

RESULT

          RESULT is DOUBLE PRECISION array, dimension (2)
          The test ratios:
            RESULT(1) = norm( A*x - c )/ norm(A)*norm(X)*EPS
            RESULT(2) = norm( B*x - d )/ norm(B)*norm(X)*EPS

Univ. of Tennessee

Univ. of California Berkeley

Univ. of Colorado Denver

NAG Ltd.