mumps_lr_common Module Reference

Functions/Subroutines
subroutine	compute_blr_vcs (k472, ibcksz, maxsize, nass)
subroutine	mumps_upd_tree (nv, nsteps, n, first, lptr, rptr, f, vlist, fils, frere_steps, step, dad_steps, ne_steps, na, lna, pvs, k38, step_scalapack_root)

Function/Subroutine Documentation

compute_blr_vcs()

subroutine mumps_lr_common::compute_blr_vcs	(	integer, intent(in)	k472,
		integer, intent(out)	ibcksz,
		integer, intent(in)	maxsize,
		integer, intent(in)	nass )

Definition at line 17 of file lr_common.F.

        INTEGER, INTENT(IN) :: MAXSIZE, NASS, K472
        INTEGER, INTENT(OUT) :: IBCKSZ
        IF (k472.EQ.1) THEN
          IF (nass.LE.1000) THEN
            ibcksz = 128
          ELSEIF (nass.GT.1000.AND.nass.LE.5000) THEN
            ibcksz = 256
          ELSEIF (nass.GT.5000.AND.nass.LE.10000) THEN
            ibcksz = 384
          ELSE
            ibcksz = 512
          ENDIF
          ibcksz = min(ibcksz,maxsize)
        ELSE
          ibcksz = maxsize
        ENDIF

mumps_upd_tree()

subroutine mumps_lr_common::mumps_upd_tree	(	integer, intent(in)	nv,
		integer, intent(in)	nsteps,
		integer, intent(in)	n,
		logical	first,
		integer, intent(inout)	lptr,
		integer, intent(inout)	rptr,
		integer, intent(in)	f,
		integer, dimension(nv), intent(in)	vlist,
		integer, dimension(:)	fils,
		integer, dimension(:)	frere_steps,
		integer, dimension(:)	step,
		integer, dimension(:)	dad_steps,
		integer, dimension(:)	ne_steps,
		integer, dimension(:)	na,
		integer, intent(in)	lna,
		integer, dimension(nsteps), intent(inout)	pvs,
		integer, intent(inout)	k38,
		integer, intent(in)	step_scalapack_root )

Definition at line 35 of file lr_common.F.

      IMPLICIT NONE
      INTEGER, INTENT(IN)    :: N, NV, NSTEPS, LNA, F, VLIST(NV)
      INTEGER                :: FILS(:), FRERE_STEPS(:),
     &     DAD_STEPS(:), STEP(:), NE_STEPS(:), NA(:)
      INTEGER, INTENT(INOUT) :: PVS(NSTEPS), LPTR, RPTR
      INTEGER, INTENT(INOUT) :: K38
      INTEGER, INTENT(IN)    :: STEP_SCALAPACK_ROOT
      LOGICAL :: FIRST
      INTEGER :: PV, NODE, I
      pv        = vlist(1)
      node      = abs(step(pv))
      pvs(node) = pv
      IF(first) THEN
         i = dad_steps(node)
         DO WHILE(fils(i).GT.0)
            i = fils(i)
         END DO
         fils(i) = -pv
      END IF
      IF(frere_steps(node) .GT. 0) THEN
         frere_steps(node) = pvs(abs(step(frere_steps(node))))
      ELSE IF(frere_steps(node) .LT. 0) THEN
         frere_steps(node) = -pvs(abs(step(dad_steps(node))))
      END IF
      IF(dad_steps(node) .EQ. 0) THEN
         na(rptr) = pv
         rptr     = rptr -1
      ELSE
         dad_steps(node) = pvs(abs(step(dad_steps(node))))
      END IF
      IF(ne_steps(node) .EQ. 0) THEN
         na(lptr) = pv
         lptr     = lptr -1
      END IF
      step(vlist(1)) = abs(step(vlist(1)))
      IF (step(vlist(1)).EQ.step_scalapack_root) THEN
       k38 = vlist(1)
      ENDIF
      DO i=1, nv-1
         IF(step(vlist(i+1)).GT.0) step(vlist(i+1)) = -step(vlist(i+1))
         fils(vlist(i)) = vlist(i+1)
      END DO
      fils(vlist(nv)) = f
      RETURN