subroutine cgeco(a,lda,n,ipvt,rcond,z)
integer lda,n,ipvt(1)
complex a(lda,1),z(1)
real rcond
c
c cgeco factors a complex matrix by gaussian elimination
c and estimates the condition of the matrix.
c
c if rcond is not needed, cgefa is slightly faster.
c to solve a*x = b , follow cgeco by cgesl.
c to compute inverse(a)*c , follow cgeco by cgesl.
c to compute determinant(a) , follow cgeco by cgedi.
c to compute inverse(a) , follow cgeco by cgedi.
c
c on entry
c
c a complex(lda, n)
c the matrix to be factored.
c
c lda integer
c the leading dimension of the array a .
c
c n integer
c the order of the matrix a .
c
c on return
c
c a an upper triangular matrix and the multipliers
c which were used to obtain it.
c the factorization can be written a = l*u where
c l is a product of permutation and unit lower
c triangular matrices and u is upper triangular.
c
c ipvt integer(n)
c an integer vector of pivot indices.
c
c rcond real
c an estimate of the reciprocal condition of a .
c for the system a*x = b , relative perturbations
c in a and b of size epsilon may cause
c relative perturbations in x of size epsilon/rcond .
c if rcond is so small that the logical expression
c 1.0 + rcond .eq. 1.0
c is true, then a may be singular to working
c precision. in particular, rcond is zero if
c exact singularity is detected or the estimate
c underflows.
c
c z complex(n)
c a work vector whose contents are usually unimportant.
c if a is close to a singular matrix, then z is
c an approximate null vector in the sense that
c norm(a*z) = rcond*norm(a)*norm(z) .
c
c linpack. this version dated 08/14/78 .
c cleve moler, university of new mexico, argonne national lab.
c
c subroutines and functions
c
c linpack cgefa
c blas caxpy,cdotc,csscal,scasum
c fortran abs,aimag,amax1,cmplx,conjg,real
c
c internal variables
c
complex cdotc,ek,t,wk,wkm
real anorm,s,scasum,sm,ynorm
integer info,j,k,kb,kp1,l
c
complex zdum,zdum1,zdum2,csign1
real cabs1
cabs1(zdum) = abs(real(zdum)) + abs(aimag(zdum))
csign1(zdum1,zdum2) = cabs1(zdum1)*(zdum2/cabs1(zdum2))
c
c compute 1-norm of a
c
anorm = 0.0e0
do 10 j = 1, n
anorm = amax1(anorm,scasum(n,a(1,j),1))
10 continue
c
c factor
c
call cgefa(a,lda,n,ipvt,info)
c
c rcond = 1/(norm(a)*(estimate of norm(inverse(a)))) .
c estimate = norm(z)/norm(y) where a*z = y and ctrans(a)*y = e .
c ctrans(a) is the conjugate transpose of a .
c the components of e are chosen to cause maximum local
c growth in the elements of w where ctrans(u)*w = e .
c the vectors are frequently rescaled to avoid overflow.
c
c solve ctrans(u)*w = e
c
ek = (1.0e0,0.0e0)
do 20 j = 1, n
z(j) = (0.0e0,0.0e0)
20 continue
do 100 k = 1, n
if (cabs1(z(k)) .ne. 0.0e0) ek = csign1(ek,-z(k))
if (cabs1(ek-z(k)) .le. cabs1(a(k,k))) go to 30
s = cabs1(a(k,k))/cabs1(ek-z(k))
call csscal(n,s,z,1)
ek = cmplx(s,0.0e0)*ek
30 continue
wk = ek - z(k)
wkm = -ek - z(k)
s = cabs1(wk)
sm = cabs1(wkm)
if (cabs1(a(k,k)) .eq. 0.0e0) go to 40
wk = wk/conjg(a(k,k))
wkm = wkm/conjg(a(k,k))
go to 50
40 continue
wk = (1.0e0,0.0e0)
wkm = (1.0e0,0.0e0)
50 continue
kp1 = k + 1
if (kp1 .gt. n) go to 90
do 60 j = kp1, n
sm = sm + cabs1(z(j)+wkm*conjg(a(k,j)))
z(j) = z(j) + wk*conjg(a(k,j))
s = s + cabs1(z(j))
60 continue
if (s .ge. sm) go to 80
t = wkm - wk
wk = wkm
do 70 j = kp1, n
z(j) = z(j) + t*conjg(a(k,j))
70 continue
80 continue
90 continue
z(k) = wk
100 continue
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
c
c solve ctrans(l)*y = w
c
do 120 kb = 1, n
k = n + 1 - kb
if (k .lt. n) z(k) = z(k) + cdotc(n-k,a(k+1,k),1,z(k+1),1)
if (cabs1(z(k)) .le. 1.0e0) go to 110
s = 1.0e0/cabs1(z(k))
call csscal(n,s,z,1)
110 continue
l = ipvt(k)
t = z(l)
z(l) = z(k)
z(k) = t
120 continue
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
c
ynorm = 1.0e0
c
c solve l*v = y
c
do 140 k = 1, n
l = ipvt(k)
t = z(l)
z(l) = z(k)
z(k) = t
if (k .lt. n) call caxpy(n-k,t,a(k+1,k),1,z(k+1),1)
if (cabs1(z(k)) .le. 1.0e0) go to 130
s = 1.0e0/cabs1(z(k))
call csscal(n,s,z,1)
ynorm = s*ynorm
130 continue
140 continue
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
ynorm = s*ynorm
c
c solve u*z = v
c
do 160 kb = 1, n
k = n + 1 - kb
if (cabs1(z(k)) .le. cabs1(a(k,k))) go to 150
s = cabs1(a(k,k))/cabs1(z(k))
call csscal(n,s,z,1)
ynorm = s*ynorm
150 continue
if (cabs1(a(k,k)) .ne. 0.0e0) z(k) = z(k)/a(k,k)
if (cabs1(a(k,k)) .eq. 0.0e0) z(k) = (1.0e0,0.0e0)
t = -z(k)
call caxpy(k-1,t,a(1,k),1,z(1),1)
160 continue
c make znorm = 1.0
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
ynorm = s*ynorm
c
if (anorm .ne. 0.0e0) rcond = ynorm/anorm
if (anorm .eq. 0.0e0) rcond = 0.0e0
return
end