1
subroutine cntnzu (n, ia, ja, nzsut)
2
integer n, ia, ja, nzsut
4
c-----------------------------------------------------------------------
5
c this routine counts the number of nonzero elements in the strict
6
c upper triangle of the matrix m + m(transpose), where the sparsity
7
c structure of m is given by pointer arrays ia and ja.
8
c this is needed to compute the storage requirements for the
9
c sparse matrix reordering operation in odrv.
10
c-----------------------------------------------------------------------
11
integer ii, jj, j, jmin, jmax, k, kmin, kmax, num
17
if (jmin .gt. jmax) go to 50
19
if (ja(j).lt.ii) go to 10
20
if (ja(j).eq.ii) go to 40
25
if (kmin .gt. kmax) go to 30
27
if (ja(k) .eq. ii) go to 40
34
c----------------------- end of subroutine cntnzu ----------------------