subroutine chico(a,lda,n,kpvt,rcond,z)
integer lda,n,kpvt(1)
complex a(lda,1),z(1)
real rcond
c
c chico factors a complex hermitian matrix by elimination with
c symmetric pivoting and estimates the condition of the matrix.
c
c if rcond is not needed, chifa is slightly faster.
c to solve a*x = b , follow chico by chisl.
c to compute inverse(a)*c , follow chico by chisl.
c to compute inverse(a) , follow chico by chidi.
c to compute determinant(a) , follow chico by chidi.
c to compute inertia(a), follow chico by chidi.
c
c on entry
c
c a complex(lda, n)
c the hermitian matrix to be factored.
c only the diagonal and upper triangle are used.
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 output
c
c a a block diagonal matrix and the multipliers which
c were used to obtain it.
c the factorization can be written a = u*d*ctrans(u)
c where u is a product of permutation and unit
c upper triangular matrices , ctrans(u) is the
c conjugate transpose of u , and d is block diagonal
c with 1 by 1 and 2 by 2 blocks.
c
c kpvt 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 chifa
c blas caxpy,cdotc,csscal,scasum
c fortran abs,aimag,amax1,cmplx,conjg,iabs,real
c
c internal variables
c
complex ak,akm1,bk,bkm1,cdotc,denom,ek,t
real anorm,s,scasum,ynorm
integer i,info,j,jm1,k,kp,kps,ks
c
complex zdum,zdum2,csign1
real cabs1
cabs1(zdum) = abs(real(zdum)) + abs(aimag(zdum))
csign1(zdum,zdum2) = cabs1(zdum)*(zdum2/cabs1(zdum2))
c
c find norm of a using only upper half
c
do 30 j = 1, n
z(j) = cmplx(scasum(j,a(1,j),1),0.0e0)
jm1 = j - 1
if (jm1 .lt. 1) go to 20
do 10 i = 1, jm1
z(i) = cmplx(real(z(i))+cabs1(a(i,j)),0.0e0)
10 continue
20 continue
30 continue
anorm = 0.0e0
do 40 j = 1, n
anorm = amax1(anorm,real(z(j)))
40 continue
c
c factor
c
call chifa(a,lda,n,kpvt,info)
c
c rcond = 1/(norm(a)*(estimate of norm(inverse(a)))) .
c estimate = norm(z)/norm(y) where a*z = y and a*y = e .
c the components of e are chosen to cause maximum local
c growth in the elements of w where u*d*w = e .
c the vectors are frequently rescaled to avoid overflow.
c
c solve u*d*w = e
c
ek = (1.0e0,0.0e0)
do 50 j = 1, n
z(j) = (0.0e0,0.0e0)
50 continue
k = n
60 if (k .eq. 0) go to 120
ks = 1
if (kpvt(k) .lt. 0) ks = 2
kp = iabs(kpvt(k))
kps = k + 1 - ks
if (kp .eq. kps) go to 70
t = z(kps)
z(kps) = z(kp)
z(kp) = t
70 continue
if (cabs1(z(k)) .ne. 0.0e0) ek = csign1(ek,z(k))
z(k) = z(k) + ek
call caxpy(k-ks,z(k),a(1,k),1,z(1),1)
if (ks .eq. 1) go to 80
if (cabs1(z(k-1)) .ne. 0.0e0) ek = csign1(ek,z(k-1))
z(k-1) = z(k-1) + ek
call caxpy(k-ks,z(k-1),a(1,k-1),1,z(1),1)
80 continue
if (ks .eq. 2) go to 100
if (cabs1(z(k)) .le. cabs1(a(k,k))) go to 90
s = cabs1(a(k,k))/cabs1(z(k))
call csscal(n,s,z,1)
ek = cmplx(s,0.0e0)*ek
90 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)
go to 110
100 continue
ak = a(k,k)/conjg(a(k-1,k))
akm1 = a(k-1,k-1)/a(k-1,k)
bk = z(k)/conjg(a(k-1,k))
bkm1 = z(k-1)/a(k-1,k)
denom = ak*akm1 - 1.0e0
z(k) = (akm1*bk - bkm1)/denom
z(k-1) = (ak*bkm1 - bk)/denom
110 continue
k = k - ks
go to 60
120 continue
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
c
c solve ctrans(u)*y = w
c
k = 1
130 if (k .gt. n) go to 160
ks = 1
if (kpvt(k) .lt. 0) ks = 2
if (k .eq. 1) go to 150
z(k) = z(k) + cdotc(k-1,a(1,k),1,z(1),1)
if (ks .eq. 2)
* z(k+1) = z(k+1) + cdotc(k-1,a(1,k+1),1,z(1),1)
kp = iabs(kpvt(k))
if (kp .eq. k) go to 140
t = z(k)
z(k) = z(kp)
z(kp) = t
140 continue
150 continue
k = k + ks
go to 130
160 continue
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
c
ynorm = 1.0e0
c
c solve u*d*v = y
c
k = n
170 if (k .eq. 0) go to 230
ks = 1
if (kpvt(k) .lt. 0) ks = 2
if (k .eq. ks) go to 190
kp = iabs(kpvt(k))
kps = k + 1 - ks
if (kp .eq. kps) go to 180
t = z(kps)
z(kps) = z(kp)
z(kp) = t
180 continue
call caxpy(k-ks,z(k),a(1,k),1,z(1),1)
if (ks .eq. 2) call caxpy(k-ks,z(k-1),a(1,k-1),1,z(1),1)
190 continue
if (ks .eq. 2) go to 210
if (cabs1(z(k)) .le. cabs1(a(k,k))) go to 200
s = cabs1(a(k,k))/cabs1(z(k))
call csscal(n,s,z,1)
ynorm = s*ynorm
200 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)
go to 220
210 continue
ak = a(k,k)/conjg(a(k-1,k))
akm1 = a(k-1,k-1)/a(k-1,k)
bk = z(k)/conjg(a(k-1,k))
bkm1 = z(k-1)/a(k-1,k)
denom = ak*akm1 - 1.0e0
z(k) = (akm1*bk - bkm1)/denom
z(k-1) = (ak*bkm1 - bk)/denom
220 continue
k = k - ks
go to 170
230 continue
s = 1.0e0/scasum(n,z,1)
call csscal(n,s,z,1)
ynorm = s*ynorm
c
c solve ctrans(u)*z = v
c
k = 1
240 if (k .gt. n) go to 270
ks = 1
if (kpvt(k) .lt. 0) ks = 2
if (k .eq. 1) go to 260
z(k) = z(k) + cdotc(k-1,a(1,k),1,z(1),1)
if (ks .eq. 2)
* z(k+1) = z(k+1) + cdotc(k-1,a(1,k+1),1,z(1),1)
kp = iabs(kpvt(k))
if (kp .eq. k) go to 250
t = z(k)
z(k) = z(kp)
z(kp) = t
250 continue
260 continue
k = k + ks
go to 240
270 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