imslinearmisc Module Reference

Functions/Subroutines
subroutine, public	ims_misc_thomas (n, tl, td, tu, b, x, w)
	Tridiagonal solve using the Thomas algorithm. More...
subroutine, public	ims_misc_dvscale (IOPT, NEQ, DSCALE, X, B)
	@ brief Scale X and RHS More...

Function/Subroutine Documentation

ims_misc_dvscale()

subroutine, public imslinearmisc::ims_misc_dvscale	(	integer(i4b), intent(in)	IOPT,
		integer(i4b), intent(in)	NEQ,
		real(dp), intent(inout)	DSCALE,
		real(dp), dimension(neq), intent(inout)	X,
		real(dp), dimension(neq), intent(inout)	B
	)

Scale X and B to avoid big or small values. Scaling value is the maximum ABS(X).

Parameters

[in]	iopt	flag to scale (0) or unscale the system of equations
[in]	neq	number of equations
[in,out]	dscale	scaling value
[in,out]	x	dependent variable
[in,out]	b	right-hand side

Definition at line 59 of file ImsLinearMisc.f90.

    ! -- dummy variables
    integer(I4B), INTENT(IN) :: IOPT !< flag to scale (0) or unscale the system of equations
    integer(I4B), INTENT(IN) :: NEQ !< number of equations
    real(DP), INTENT(INOUT) :: DSCALE !< scaling value
    real(DP), DIMENSION(NEQ), INTENT(INOUT) :: X !< dependent variable
    real(DP), DIMENSION(NEQ), INTENT(INOUT) :: B !< right-hand side
    ! -- local variables
    integer(I4B) :: n
    !
    ! -- SCALE SCALE AMAT, X, AND B
    IF (iopt == 0) THEN
      dscale = abs(dscale)
      if (dscale < dem30) then
        dscale = done
      end if
      DO n = 1, neq
        b(n) = b(n) / dscale
        x(n) = x(n) / dscale
      END DO
      !
      ! -- UNSCALE X, AND B
    ELSE
      DO n = 1, neq
        b(n) = b(n) * dscale
        x(n) = x(n) * dscale
      END DO
    END IF

Here is the caller graph for this function:

ims_misc_thomas()

subroutine, public imslinearmisc::ims_misc_thomas	(	integer(i4b), intent(in)	n,
		real(dp), dimension(n), intent(in)	tl,
		real(dp), dimension(n), intent(in)	td,
		real(dp), dimension(n), intent(in)	tu,
		real(dp), dimension(n), intent(in)	b,
		real(dp), dimension(n), intent(inout)	x,
		real(dp), dimension(n), intent(inout)	w
	)

Subroutine to solve tridiagonal linear equations using the Thomas algorithm.

Parameters

[in]	n	number of matrix rows
[in]	tl	lower matrix terms
[in]	td	diagonal matrix terms
[in]	tu	upper matrix terms
[in]	b	right-hand side vector
[in,out]	x	solution vector
[in,out]	w	work vector

Definition at line 18 of file ImsLinearMisc.f90.

    implicit none
    ! -- dummy variables
    integer(I4B), intent(in) :: n !< number of matrix rows
    real(DP), dimension(n), intent(in) :: tl !< lower matrix terms
    real(DP), dimension(n), intent(in) :: td !< diagonal matrix terms
    real(DP), dimension(n), intent(in) :: tu !< upper matrix terms
    real(DP), dimension(n), intent(in) :: b !< right-hand side vector
    real(DP), dimension(n), intent(inout) :: x !< solution vector
    real(DP), dimension(n), intent(inout) :: w !< work vector
    ! -- local variables
    integer(I4B) :: j
    real(DP) :: bet
    real(DP) :: beti
    !
    ! -- initialize variables
    w(1) = dzero
    bet = td(1)
    beti = done / bet
    x(1) = b(1) * beti
    !
    ! -- decomposition and forward substitution
    do j = 2, n
      w(j) = tu(j - 1) * beti
      bet = td(j) - tl(j) * w(j)
      beti = done / bet
      x(j) = (b(j) - tl(j) * x(j - 1)) * beti
    end do
    !
    ! -- backsubstitution
    do j = n - 1, 1, -1
      x(j) = x(j) - w(j + 1) * x(j + 1)
    end do

Here is the caller graph for this function: