regrid_edge_values Module Reference

Functions/Subroutines
subroutine, public	bound_edge_values (N, h, u, edge_values)
subroutine, public	average_discontinuous_edge_values (N, edge_values)
subroutine, public	check_discontinuous_edge_values (N, u, edge_values)
subroutine, public	edge_values_explicit_h2 (N, h, u, edge_values)
subroutine, public	edge_values_explicit_h4 (N, h, u, edge_values)
subroutine, public	edge_values_implicit_h4 (N, h, u, edge_values)
subroutine, public	edge_values_implicit_h6 (N, h, u, edge_values)

Variables
real, parameter	hnegligible = 1.e-10
real, parameter	hminfrac = 1.e-5

Function/Subroutine Documentation

average_discontinuous_edge_values()

subroutine, public regrid_edge_values::average_discontinuous_edge_values	(	integer, intent(in)	N,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 147 of file regrid_edge_values.F90.

Referenced by p1m_functions::p1m_interpolation(), and p3m_functions::p3m_limiter().

! ------------------------------------------------------------------------------
! For each interior edge, check whether the edge values are discontinuous.
! If so, compute the average and replace the edge values by the average.!
! ------------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)    :: n ! Number of cells
  real, dimension(:,:), intent(inout) :: edge_values

  ! Local variables
  integer       :: k            ! loop index
  real          :: u0_minus     ! left value at given edge
  real          :: u0_plus      ! right value at given edge
  real          :: u0_avg       ! avg value at given edge

  ! Loop on interior edges
  do k = 1,n-1

    ! Edge value on the left of the edge
    u0_minus = edge_values(k,2)

    ! Edge value on the right of the edge
    u0_plus  = edge_values(k+1,1)

    if ( u0_minus .NE. u0_plus ) then
      u0_avg = 0.5 * ( u0_minus + u0_plus )
      edge_values(k,2) = u0_avg
      edge_values(k+1,1) = u0_avg
    end if

  end do ! end loop on interior edges

Here is the caller graph for this function:

bound_edge_values()

subroutine, public regrid_edge_values::bound_edge_values	(	integer, intent(in)	N,
		real, dimension(:), intent(in)	h,
		real, dimension(:), intent(in)	u,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 44 of file regrid_edge_values.F90.

Referenced by p1m_functions::p1m_interpolation(), p3m_functions::p3m_limiter(), ppm_functions::ppm_limiter_standard(), and pqm_functions::pqm_limiter().

! ------------------------------------------------------------------------------
! In this routine, we loop on all cells to bound their left and right
! edge values by the cell averages. That is, the left edge value must lie
! between the left cell average and the central cell average. A similar
! reasoning applies to the right edge values.
!
! Both boundary edge values are set equal to the boundary cell averages.
! Any extrapolation scheme is applied after this routine has been called.
! Therefore, boundary cells are treated as if they were local extrama.
! ------------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)    :: n ! Number of cells
  real, dimension(:),   intent(in)    :: h ! cell widths (size N)
  real, dimension(:),   intent(in)    :: u ! cell averages (size N)
  real, dimension(:,:), intent(inout) :: edge_values

  ! Local variables
  integer       :: k            ! loop index
  integer       :: k0, k1, k2
  real          :: h_l, h_c, h_r
  real          :: u_l, u_c, u_r
  real          :: u0_l, u0_r
  real          :: sigma_l, sigma_c, sigma_r    ! left, center and right
                                                ! van Leer slopes
  real          :: slope                ! retained PLM slope


  ! Loop on cells to bound edge value
  do k = 1,n

    ! For the sake of bounding boundary edge values, the left neighbor
    ! of the left boundary cell is assumed to be the same as the left
    ! boundary cell and the right neighbor of the right boundary cell
    ! is assumed to be the same as the right boundary cell. This
    ! effectively makes boundary cells look like extrema.
    if ( k .EQ. 1 ) then
      k0 = 1
      k1 = 1
      k2 = 2
    else if ( k .EQ. n ) then
      k0 = n-1
      k1 = n
      k2 = n
    else
      k0 = k-1
      k1 = k
      k2 = k+1
    end if

    ! All cells can now be treated equally
    h_l = h(k0)
    h_c = h(k1)
    h_r = h(k2)

    u_l = u(k0)
    u_c = u(k1)
    u_r = u(k2)

    u0_l = edge_values(k,1)
    u0_r = edge_values(k,2)

    sigma_l = 2.0 * ( u_c - u_l ) / ( h_c + 1.e-30 )
    sigma_c = 2.0 * ( u_r - u_l ) / ( h_l + 2.0*h_c + h_r + 1.e-30 )
    sigma_r = 2.0 * ( u_r - u_c ) / ( h_c + 1.e-30 )

    if ( (sigma_l * sigma_r) .GT. 0.0 ) then
      slope = sign( min(abs(sigma_l),abs(sigma_c),abs(sigma_r)), sigma_c )
    else
      slope = 0.0
    end if

    ! The limiter must be used in the local coordinate system to each cell.
    ! Hence, we must multiply the slope by h1. The multiplication by 0.5 is
    ! simply a way to make it useable in the limiter (cfr White and Adcroft
    ! JCP 2008 Eqs 19 and 20)
    slope = slope * h_c * 0.5

    if ( (u_l-u0_l)*(u0_l-u_c) .LT. 0.0 ) then
      u0_l = u_c - sign( min( abs(slope), abs(u0_l-u_c) ), slope )
    end if

    if ( (u_r-u0_r)*(u0_r-u_c) .LT. 0.0 ) then
      u0_r = u_c + sign( min( abs(slope), abs(u0_r-u_c) ), slope )
    end if

    ! Finally bound by neighboring cell means in case of round off
    u0_l = max( min( u0_l, max(u_l, u_c) ), min(u_l, u_c) )
    u0_r = max( min( u0_r, max(u_r, u_c) ), min(u_r, u_c) )

    ! Store edge values
    edge_values(k,1) = u0_l
    edge_values(k,2) = u0_r

  end do ! loop on interior edges

Here is the caller graph for this function:

check_discontinuous_edge_values()

subroutine, public regrid_edge_values::check_discontinuous_edge_values	(	integer, intent(in)	N,
		real, dimension(:), intent(in)	u,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 186 of file regrid_edge_values.F90.

Referenced by ppm_functions::ppm_limiter_standard(), and pqm_functions::pqm_limiter().

! ------------------------------------------------------------------------------
! For each interior edge, check whether the edge values are discontinuous.
! If so and if they are not monotonic, replace each edge value by their average.
! ------------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)    :: n ! Number of cells
  real, dimension(:),   intent(in)    :: u ! cell averages (size N)
  real, dimension(:,:), intent(inout) :: edge_values

  ! Local variables
  integer       :: k            ! loop index
  real          :: u0_minus     ! left value at given edge
  real          :: u0_plus      ! right value at given edge
  real          :: um_minus     ! left cell average
  real          :: um_plus      ! right cell average
  real          :: u0_avg       ! avg value at given edge

  ! Loop on interior cells
  do k = 1,n-1

    ! Edge value on the left of the edge
    u0_minus = edge_values(k,2)

    ! Edge value on the right of the edge
    u0_plus  = edge_values(k+1,1)

    ! Left cell average
    um_minus = u(k)

    ! Right cell average
    um_plus = u(k+1)

    if ( (u0_plus - u0_minus)*(um_plus - um_minus) .LT. 0.0 ) then
      u0_avg = 0.5 * ( u0_minus + u0_plus )
      u0_avg = max( min( u0_avg, max(um_minus, um_plus) ), min(um_minus, um_plus) )
      edge_values(k,2) = u0_avg
      edge_values(k+1,1) = u0_avg
    end if

  end do ! end loop on interior edges

Here is the caller graph for this function:

edge_values_explicit_h2()

subroutine, public regrid_edge_values::edge_values_explicit_h2	(	integer, intent(in)	N,
		real, dimension(:), intent(in)	h,
		real, dimension(:), intent(in)	u,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 235 of file regrid_edge_values.F90.

References hnegligible.

! ------------------------------------------------------------------------------
! Compute edge values based on second-order explicit estimates.
! These estimates are based on a straight line spanning two cells and evaluated
! at the location of the middle edge. An interpolant spanning cells
! k-1 and k is evaluated at edge k-1/2. The estimate for each edge is unique.
!
!       k-1     k
! ..--o------o------o--..
!          k-1/2
!
! Boundary edge values are set to be equal to the boundary cell averages.
! ------------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)    :: n ! Number of cells
  real, dimension(:),   intent(in)    :: h ! cell widths (size N)
  real, dimension(:),   intent(in)    :: u ! cell averages (size N)
  real, dimension(:,:), intent(inout) :: edge_values

  ! Local variables
  integer   :: k        ! loop index
  real      :: h0, h1   ! cell widths
  real      :: u0, u1   ! cell averages

  ! Loop on interior cells
  do k = 2,n

    h0 = h(k-1)
    h1 = h(k)

    ! Avoid singularities when h0+h1=0
    if (h0+h1==0.) then
      h0 = hnegligible
      h1 = hnegligible
    endif

    u0 = u(k-1)
    u1 = u(k)

    ! Compute left edge value
    edge_values(k,1) = ( u0*h1 + u1*h0 ) / ( h0 + h1 )

    ! Left edge value of the current cell is equal to right edge
    ! value of left cell
    edge_values(k-1,2) = edge_values(k,1)

  end do ! end loop on interior cells

  ! Boundary edge values are simply equal to the boundary cell averages
  edge_values(1,1) = u(1)
  edge_values(n,2) = u(n)

edge_values_explicit_h4()

subroutine, public regrid_edge_values::edge_values_explicit_h4	(	integer, intent(in)	N,
		real, dimension(:), intent(in)	h,
		real, dimension(:), intent(in)	u,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 294 of file regrid_edge_values.F90.

References polynomial_functions::evaluation_polynomial(), hminfrac, hnegligible, and regrid_solvers::solve_linear_system().

! -----------------------------------------------------------------------------
! Compute edge values based on fourth-order explicit estimates.
! These estimates are based on a cubic interpolant spanning four cells
! and evaluated at the location of the middle edge. An interpolant spanning
! cells i-2, i-1, i and i+1 is evaluated at edge i-1/2. The estimate for
! each edge is unique.
!
!       i-2    i-1     i     i+1
! ..--o------o------o------o------o--..
!                 i-1/2
!
! The first two edge values are estimated by evaluating the first available
! cubic interpolant, i.e., the interpolant spanning cells 1, 2, 3 and 4.
! Similarly, the last two edge values are estimated by evaluating the last
! available interpolant.
!
! For this fourth-order scheme, at least four cells must exist.
! -----------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)    :: n ! Number of cells
  real, dimension(:),   intent(in)    :: h ! cell widths (size N)
  real, dimension(:),   intent(in)    :: u ! cell averages (size N)
  real, dimension(:,:), intent(inout) :: edge_values

  ! Local variables
  integer               :: i, j
  real                  :: u0, u1, u2, u3
  real                  :: h0, h1, h2, h3
  real                  :: f1, f2, f3       ! auxiliary variables
  real                  :: e                ! edge value
  real, dimension(5)    :: x                ! used to compute edge
  real, dimension(4,4)  :: a                ! values near the boundaries
  real, dimension(4)    :: b, c

  ! Loop on interior cells
  do i = 3,n-1

    h0 = h(i-2)
    h1 = h(i-1)
    h2 = h(i)
    h3 = h(i+1)

    ! Avoid singularities when consecutive pairs of h vanish
    if (h0+h1==0. .or. h1+h2==0. .or. h2+h3==0.) then
      f1 = max( hnegligible, h0+h1+h2+h3 )
      h0 = max( hminfrac*f1, h(i-2) )
      h1 = max( hminfrac*f1, h(i-1) )
      h2 = max( hminfrac*f1, h(i) )
      h3 = max( hminfrac*f1, h(i+1) )
    endif

    u0 = u(i-2)
    u1 = u(i-1)
    u2 = u(i)
    u3 = u(i+1)

    f1 = (h0+h1) * (h2+h3) / (h1+h2)
    f2 = u1 * h2 + u2 * h1
    f3 = 1.0 / (h0+h1+h2) + 1.0 / (h1+h2+h3)

    e = f1 * f2 * f3

    f1 = h2 * (h2+h3) / ( (h0+h1+h2)*(h0+h1) )
    f2 = u1*(h0+2.0*h1) - u0*h1

    e = e + f1*f2

    f1 = h1 * (h0+h1) / ( (h1+h2+h3)*(h2+h3) )
    f2 = u2*(2.0*h2+h3) - u3*h2

    e = e + f1*f2

    e = e / ( h0 + h1 + h2 + h3)

    edge_values(i,1) = e
    edge_values(i-1,2) = e

#ifdef __DO_SAFETY_CHECKS__
    if (e /= e) then
      write(0,*) 'NaN in explicit_edge_h4 at k=',i
      write(0,*) 'u0-u3=',u0,u1,u2,u3
      write(0,*) 'h0-h3=',h0,h1,h2,h3
      write(0,*) 'f1-f3=',f1,f2,f3
      stop 'Nan during edge_values_explicit_h4'
    endif
#endif

  end do ! end loop on interior cells

  ! Determine first two edge values
  f1 = max( hnegligible, hminfrac*sum(h(1:4)) )
  x(1) = 0.0
  do i = 2,5
    x(i) = x(i-1) + max(f1, h(i-1))
  end do

  do i = 1,4

    do j = 1,4
      a(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / real(j)
    end do

    b(i) = u(i) * max(f1, h(i) )

  end do

  call solve_linear_system( a, b, c, 4 )

  ! First edge value
  edge_values(1,1) = evaluation_polynomial( c, 4, x(1) )

  ! Second edge value
  edge_values(1,2) = evaluation_polynomial( c, 4, x(2) )
  edge_values(2,1) = edge_values(1,2)

#ifdef __DO_SAFETY_CHECKS__
  if (edge_values(1,1) /= edge_values(1,1) .or. edge_values(1,2) /= edge_values(1,2)) then
    write(0,*) 'NaN in explicit_edge_h4 at k=',1
    write(0,*) 'A=',a
    write(0,*) 'B=',b
    write(0,*) 'C=',c
    write(0,*) 'h(1:4)=',h(1:4)
    write(0,*) 'x=',x
    stop 'Nan during edge_values_explicit_h4'
  endif
#endif

  ! Determine last two edge values
  f1 = max( hnegligible, hminfrac*sum(h(n-3:n)) )
  x(1) = 0.0
  do i = 2,5
    x(i) = x(i-1) + max(f1, h(n-5+i))
  end do

  do i = 1,4

    do j = 1,4
      a(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / real(j)
    end do

    b(i) = u(n-4+i) * max(f1,  h(n-4+i) )

  end do

  call solve_linear_system( a, b, c, 4 )

  ! Last edge value
  edge_values(n,2) = evaluation_polynomial( c, 4, x(5) )

  ! Second to last edge value
  edge_values(n,1) = evaluation_polynomial( c, 4, x(4) )
  edge_values(n-1,2) = edge_values(n,1)

#ifdef __DO_SAFETY_CHECKS__
  if (edge_values(n,1) /= edge_values(n,1) .or. edge_values(n,2) /= edge_values(n,2)) then
    write(0,*) 'NaN in explicit_edge_h4 at k=',n
    write(0,*) 'A='
    do i = 1,4
      do j = 1,4
        a(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / real(j)
      end do
      write(0,*) a(i,:)
      b(i) = u(n-4+i) * ( h(n-4+i) )
    end do
    write(0,*) 'B=',b
    write(0,*) 'C=',c
    write(0,*) 'h(:N)=',h(n-3:n)
    write(0,*) 'x=',x
    stop 'Nan during edge_values_explicit_h4'
  endif
#endif

Here is the call graph for this function:

edge_values_implicit_h4()

subroutine, public regrid_edge_values::edge_values_implicit_h4	(	integer, intent(in)	N,
		real, dimension(:), intent(in)	h,
		real, dimension(:), intent(in)	u,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 474 of file regrid_edge_values.F90.

References polynomial_functions::evaluation_polynomial(), hminfrac, hnegligible, regrid_solvers::solve_linear_system(), and regrid_solvers::solve_tridiagonal_system().

Referenced by mom_remapping::build_reconstructions_1d(), mom_ale::pressure_gradient_ppm(), and regrid_interp::regridding_set_ppolys().

! -----------------------------------------------------------------------------
! Compute edge values based on fourth-order implicit estimates.
!
! Fourth-order implicit estimates of edge values are based on a two-cell
! stencil. A tridiagonal system is set up and is based on expressing the
! edge values in terms of neighboring cell averages. The generic
! relationship is
!
! \alpha u_{i-1/2} + u_{i+1/2} + \beta u_{i+3/2} = a \bar{u}_i + b \bar{u}_{i+1}
!
! and the stencil looks like this
!
!          i     i+1
!   ..--o------o------o--..
!     i-1/2  i+1/2  i+3/2
!
! In this routine, the coefficients \alpha, \beta, a and b are computed,
! the tridiagonal system is built, boundary conditions are prescribed and
! the system is solved to yield edge-value estimates.
!
! There are N+1 unknowns and we are able to write N-1 equations. The
! boundary conditions close the system.
! -----------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)     :: n ! Number of cells
  real, dimension(:),   intent(in)     :: h ! cell widths (size N)
  real, dimension(:),   intent(in)     :: u ! cell averages (size N)
  real, dimension(:,:), intent(inout)  :: edge_values

  ! Local variables
  integer               :: i, j                 ! loop indexes
  real                  :: h0, h1               ! cell widths
  real                  :: h0_2, h1_2, h0h1
  real                  :: d2, d4
  real                  :: alpha, beta          ! stencil coefficients
  real                  :: a, b
  real, dimension(5)    :: x                    ! system used to enforce
  real, dimension(4,4)  :: asys                 ! boundary conditions
  real, dimension(4)    :: bsys, csys
  real, dimension(N+1)  :: tri_l, &             ! trid. system (lower diagonal)
                           tri_d, &             ! trid. system (middle diagonal)
                           tri_u, &             ! trid. system (upper diagonal)
                           tri_b, &             ! trid. system (unknowns vector)
                           tri_x                ! trid. system (rhs)

  ! Loop on cells (except last one)
  do i = 1,n-1

    ! Get cell widths
    h0 = h(i)
    h1 = h(i+1)

    ! Avoid singularities when h0+h1=0
    if (h0+h1==0.) then
      h0 = hnegligible
      h1 = hnegligible
    endif

    ! Auxiliary calculations
    d2 = (h0 + h1) ** 2
    d4 = d2 ** 2
    h0h1 = h0 * h1
    h0_2 = h0 * h0
    h1_2 = h1 * h1

    ! Coefficients
    alpha = h1_2 / d2
    beta = h0_2 / d2
    a = 2.0 * h1_2 * ( h1_2 + 2.0 * h0_2 + 3.0 * h0h1 ) / d4
    b = 2.0 * h0_2 * ( h0_2 + 2.0 * h1_2 + 3.0 * h0h1 ) / d4

    tri_l(i+1) = alpha
    tri_d(i+1) = 1.0
    tri_u(i+1) = beta

    tri_b(i+1) = a * u(i) + b * u(i+1)

  end do ! end loop on cells

  ! Boundary conditions: left boundary
  h0 = max( hnegligible, hminfrac*sum(h(1:4)) )
  x(1) = 0.0
  do i = 2,5
    x(i) = x(i-1) + max( h0, h(i-1) )
  end do

  do i = 1,4

    do j = 1,4
      asys(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / j
    end do

    bsys(i) = u(i) * max( h0, h(i) )

  end do

  call solve_linear_system( asys, bsys, csys, 4 )

  tri_d(1) = 1.0
  tri_u(1) = 0.0
  tri_b(1) = evaluation_polynomial( csys, 4, x(1) )        ! first edge value

  ! Boundary conditions: right boundary
  h0 = max( hnegligible, hminfrac*sum(h(n-3:n)) )
  x(1) = 0.0
  do i = 2,5
    x(i) = x(i-1) + max( h0, h(n-5+i) )
  end do

  do i = 1,4

    do j = 1,4
      asys(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / j
    end do

    bsys(i) = u(n-4+i) * max( h0, h(n-4+i) )

  end do

  call solve_linear_system( asys, bsys, csys, 4 )

  tri_l(n+1) = 0.0
  tri_d(n+1) = 1.0
  tri_b(n+1) = evaluation_polynomial( csys, 4, x(5) )      ! last edge value

  ! Solve tridiagonal system and assign edge values
  call solve_tridiagonal_system( tri_l, tri_d, tri_u, tri_b, tri_x, n+1 )

  do i = 2,n
    edge_values(i,1)   = tri_x(i)
    edge_values(i-1,2) = tri_x(i)
  end do
  edge_values(1,1) = tri_x(1)
  edge_values(n,2) = tri_x(n+1)

Here is the call graph for this function:

Here is the caller graph for this function:

edge_values_implicit_h6()

subroutine, public regrid_edge_values::edge_values_implicit_h6	(	integer, intent(in)	N,
		real, dimension(:), intent(in)	h,
		real, dimension(:), intent(in)	u,
		real, dimension(:,:), intent(inout)	edge_values
	)

Definition at line 617 of file regrid_edge_values.F90.

References polynomial_functions::evaluation_polynomial(), hminfrac, hnegligible, regrid_solvers::solve_linear_system(), and regrid_solvers::solve_tridiagonal_system().

Referenced by mom_remapping::build_reconstructions_1d(), and regrid_interp::regridding_set_ppolys().

! -----------------------------------------------------------------------------
! Sixth-order implicit estimates of edge values are based on a four-cell,
! three-edge stencil. A tridiagonal system is set up and is based on
! expressing the edge values in terms of neighboring cell averages.
!
! The generic relationship is
!
! \alpha u_{i-1/2} + u_{i+1/2} + \beta u_{i+3/2} =
! a \bar{u}_{i-1} + b \bar{u}_i + c \bar{u}_{i+1} + d \bar{u}_{i+2}
!
! and the stencil looks like this
!
!         i-1     i     i+1    i+2
!   ..--o------o------o------o------o--..
!            i-1/2  i+1/2  i+3/2
!
! In this routine, the coefficients \alpha, \beta, a, b, c and d are
! computed, the tridiagonal system is built, boundary conditions are
! prescribed and the system is solved to yield edge-value estimates.
!
! Note that the centered stencil only applies to edges 3 to N-1 (edges are
! numbered 1 to n+1), which yields N-3 equations for N+1 unknowns. Two other
! equations are written by using a right-biased stencil for edge 2 and a
! left-biased stencil for edge N. The prescription of boundary conditions
! (using sixth-order polynomials) closes the system.
!
! CAUTION: For each edge, in order to determine the coefficients of the
!          implicit expression, a 6x6 linear system is solved. This may
!          become computationally expensive if regridding is carried out
!          often. Figuring out closed-form expressions for these coefficients
!          on nonuniform meshes turned out to be intractable.
! -----------------------------------------------------------------------------

  ! Arguments
  integer,              intent(in)     :: n ! Number of cells
  real, dimension(:),   intent(in)     :: h ! cell widths (size N)
  real, dimension(:),   intent(in)     :: u ! cell averages (size N)
  real, dimension(:,:), intent(inout)  :: edge_values

  ! Local variables
  integer               :: i, j, k              ! loop indexes
  real                  :: h0, h1, h2, h3       ! cell widths
  real                  :: g, g_2, g_3          ! the following are
  real                  :: g_4, g_5, g_6        ! auxiliary variables
  real                  :: d2, d3, d4, d5, d6   ! to set up the systems
  real                  :: n2, n3, n4, n5, n6   ! used to compute the
  real                  :: h1_2, h2_2           ! the coefficients of the
  real                  :: h1_3, h2_3           ! tridiagonal system
  real                  :: h1_4, h2_4           ! ...
  real                  :: h1_5, h2_5           ! ...
  real                  :: h1_6, h2_6           ! ...
  real                  :: h0ph1, h0ph1_2       ! ...
  real                  :: h0ph1_3, h0ph1_4     ! ...
  real                  :: h2ph3, h2ph3_2       ! ...
  real                  :: h2ph3_3, h2ph3_4     ! ...
  real                  :: h0ph1_5, h2ph3_5     ! ...
  real                  :: alpha, beta          ! stencil coefficients
  real                  :: a, b, c, d           ! "
  real, dimension(7)    :: x                    ! system used to enforce
  real, dimension(6,6)  :: asys                 ! boundary conditions
  real, dimension(6)    :: bsys, csys           ! ...
  real, dimension(N+1)  :: tri_l, &             ! trid. system (lower diagonal)
                           tri_d, &             ! trid. system (middle diagonal)
                           tri_u, &             ! trid. system (upper diagonal)
                           tri_b, &             ! trid. system (unknowns vector)
                           tri_x                ! trid. system (rhs)

  ! Loop on cells (except last one)
  do k = 2,n-2

    ! Cell widths
    h0 = h(k-1)
    h1 = h(k+0)
    h2 = h(k+1)
    h3 = h(k+2)

    ! Avoid singularities when h0=0 or h3=0
    if (h0*h3==0.) then
      g = max( hnegligible, h0+h1+h2+h3 )
      h0 = max( hminfrac*g, h0 )
      h1 = max( hminfrac*g, h1 )
      h2 = max( hminfrac*g, h2 )
      h3 = max( hminfrac*g, h3 )
    endif

    ! Auxiliary calculations
    h1_2 = h1 * h1
    h1_3 = h1_2 * h1
    h1_4 = h1_2 * h1_2
    h1_5 = h1_3 * h1_2
    h1_6 = h1_3 * h1_3

    h2_2 = h2 * h2
    h2_3 = h2_2 * h2
    h2_4 = h2_2 * h2_2
    h2_5 = h2_3 * h2_2
    h2_6 = h2_3 * h2_3

    g   = h0 + h1
    g_2 = g * g
    g_3 = g * g_2
    g_4 = g_2 * g_2
    g_5 = g_4 * g
    g_6 = g_3 * g_3

    d2 = ( h1_2 - g_2 ) / h0
    d3 = ( h1_3 - g_3 ) / h0
    d4 = ( h1_4 - g_4 ) / h0
    d5 = ( h1_5 - g_5 ) / h0
    d6 = ( h1_6 - g_6 ) / h0

    g   = h2 + h3
    g_2 = g * g
    g_3 = g * g_2
    g_4 = g_2 * g_2
    g_5 = g_4 * g
    g_6 = g_3 * g_3

    n2 = ( g_2 - h2_2 ) / h3
    n3 = ( g_3 - h2_3 ) / h3
    n4 = ( g_4 - h2_4 ) / h3
    n5 = ( g_5 - h2_5 ) / h3
    n6 = ( g_6 - h2_6 ) / h3

    ! Compute matrix entries
    asys(1,1) = 1.0
    asys(1,2) = 1.0
    asys(1,3) = -1.0
    asys(1,4) = -1.0
    asys(1,5) = -1.0
    asys(1,6) = -1.0

    asys(2,1) = - h1
    asys(2,2) = h2
    asys(2,3) = -0.5 * d2
    asys(2,4) = 0.5 * h1
    asys(2,5) = -0.5 * h2
    asys(2,6) = -0.5 * n2

    asys(3,1) = 0.5 * h1_2
    asys(3,2) = 0.5 * h2_2
    asys(3,3) = d3 / 6.0
    asys(3,4) = - h1_2 / 6.0
    asys(3,5) = - h2_2 / 6.0
    asys(3,6) = - n3 / 6.0

    asys(4,1) = - h1_3 / 6.0
    asys(4,2) = h2_3 / 6.0
    asys(4,3) = - d4 / 24.0
    asys(4,4) = h1_3 / 24.0
    asys(4,5) = - h2_3 / 24.0
    asys(4,6) = - n4 / 24.0

    asys(5,1) = h1_4 / 24.0
    asys(5,2) = h2_4 / 24.0
    asys(5,3) = d5 / 120.0
    asys(5,4) = - h1_4 / 120.0
    asys(5,5) = - h2_4 / 120.0
    asys(5,6) = - n5 / 120.0

    asys(6,1) = - h1_5 / 120.0
    asys(6,2) = h2_5 / 120.0
    asys(6,3) = - d6 / 720.0
    asys(6,4) = h1_5 / 720.0
    asys(6,5) = - h2_5 / 720.0
    asys(6,6) = - n6 / 720.0

    bsys(:) = (/ -1.0, 0.0, 0.0, 0.0, 0.0, 0.0 /)

    call solve_linear_system( asys, bsys, csys, 6 )

    alpha = csys(1)
    beta  = csys(2)
    a = csys(3)
    b = csys(4)
    c = csys(5)
    d = csys(6)

    tri_l(k+1) = alpha
    tri_d(k+1) = 1.0
    tri_u(k+1) = beta
    tri_b(k+1) = a * u(k-1) + b * u(k) + c * u(k+1) + d * u(k+2)

  end do ! end loop on cells

  ! Use a right-biased stencil for the second row

  ! Cell widths
  h0 = h(1)
  h1 = h(2)
  h2 = h(3)
  h3 = h(4)

  ! Avoid singularities when h0=0 or h3=0
  if (h0*h3==0.) then
    g = max( hnegligible, h0+h1+h2+h3 )
    h0 = max( hminfrac*g, h0 )
    h1 = max( hminfrac*g, h1 )
    h2 = max( hminfrac*g, h2 )
    h3 = max( hminfrac*g, h3 )
  endif

  ! Auxiliary calculations
  h1_2 = h1 * h1
  h1_3 = h1_2 * h1
  h1_4 = h1_2 * h1_2
  h1_5 = h1_3 * h1_2
  h1_6 = h1_3 * h1_3

  h2_2 = h2 * h2
  h2_3 = h2_2 * h2
  h2_4 = h2_2 * h2_2
  h2_5 = h2_3 * h2_2
  h2_6 = h2_3 * h2_3

  g   = h0 + h1
  g_2 = g * g
  g_3 = g * g_2
  g_4 = g_2 * g_2
  g_5 = g_4 * g
  g_6 = g_3 * g_3

  h0ph1   = h0 + h1
  h0ph1_2 = h0ph1 * h0ph1
  h0ph1_3 = h0ph1_2 * h0ph1
  h0ph1_4 = h0ph1_2 * h0ph1_2
  h0ph1_5 = h0ph1_3 * h0ph1_2

  d2 = ( h1_2 - g_2 ) / h0
  d3 = ( h1_3 - g_3 ) / h0
  d4 = ( h1_4 - g_4 ) / h0
  d5 = ( h1_5 - g_5 ) / h0
  d6 = ( h1_6 - g_6 ) / h0

  g   = h2 + h3
  g_2 = g * g
  g_3 = g * g_2
  g_4 = g_2 * g_2
  g_5 = g_4 * g
  g_6 = g_3 * g_3

  n2 = ( g_2 - h2_2 ) / h3
  n3 = ( g_3 - h2_3 ) / h3
  n4 = ( g_4 - h2_4 ) / h3
  n5 = ( g_5 - h2_5 ) / h3
  n6 = ( g_6 - h2_6 ) / h3

  ! Compute matrix entries
  asys(1,1) = 1.0
  asys(1,2) = 1.0
  asys(1,3) = -1.0
  asys(1,4) = -1.0
  asys(1,5) = -1.0
  asys(1,6) = -1.0

  asys(2,1) = - h0ph1
  asys(2,2) = 0.0
  asys(2,3) = -0.5 * d2
  asys(2,4) = 0.5 * h1
  asys(2,5) = -0.5 * h2
  asys(2,6) = -0.5 * n2

  asys(3,1) = 0.5 * h0ph1_2
  asys(3,2) = 0.0
  asys(3,3) = d3 / 6.0
  asys(3,4) = - h1_2 / 6.0
  asys(3,5) = - h2_2 / 6.0
  asys(3,6) = - n3 / 6.0

  asys(4,1) = - h0ph1_3 / 6.0
  asys(4,2) = 0.0
  asys(4,3) = - d4 / 24.0
  asys(4,4) = h1_3 / 24.0
  asys(4,5) = - h2_3 / 24.0
  asys(4,6) = - n4 / 24.0

  asys(5,1) = h0ph1_4 / 24.0
  asys(5,2) = 0.0
  asys(5,3) = d5 / 120.0
  asys(5,4) = - h1_4 / 120.0
  asys(5,5) = - h2_4 / 120.0
  asys(5,6) = - n5 / 120.0

  asys(6,1) = - h0ph1_5 / 120.0
  asys(6,2) = 0.0
  asys(6,3) = - d6 / 720.0
  asys(6,4) = h1_5 / 720.0
  asys(6,5) = - h2_5 / 720.0
  asys(6,6) = - n6 / 720.0

  bsys(:) = (/ -1.0, h1, -0.5*h1_2, h1_3/6.0, -h1_4/24.0, h1_5/120.0 /)

  call solve_linear_system( asys, bsys, csys, 6 )

  alpha = csys(1)
  beta  = csys(2)
  a = csys(3)
  b = csys(4)
  c = csys(5)
  d = csys(6)

  tri_l(2) = alpha
  tri_d(2) = 1.0
  tri_u(2) = beta
  tri_b(2) = a * u(1) + b * u(2) + c * u(3) + d * u(4)

  ! Boundary conditions: left boundary
  g = max( hnegligible, hminfrac*sum(h(1:6)) )
  x(1) = 0.0
  do i = 2,7
    x(i) = x(i-1) + max( g, h(i-1) )
  end do

  do i = 1,6

    do j = 1,6
      asys(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / j
    end do

    bsys(i) = u(i) * max( g, h(i) )

  end do

  call solve_linear_system( asys, bsys, csys, 6 )

  tri_l(1) = 0.0
  tri_d(1) = 1.0
  tri_u(1) = 0.0
  tri_b(1) = evaluation_polynomial( csys, 6, x(1) )        ! first edge value

  ! Use a left-biased stencil for the second to last row

  ! Cell widths
  h0 = h(n-3)
  h1 = h(n-2)
  h2 = h(n-1)
  h3 = h(n)

  ! Avoid singularities when h0=0 or h3=0
  if (h0*h3==0.) then
    g = max( hnegligible, h0+h1+h2+h3 )
    h0 = max( hminfrac*g, h0 )
    h1 = max( hminfrac*g, h1 )
    h2 = max( hminfrac*g, h2 )
    h3 = max( hminfrac*g, h3 )
  endif

  ! Auxiliary calculations
  h1_2 = h1 * h1
  h1_3 = h1_2 * h1
  h1_4 = h1_2 * h1_2
  h1_5 = h1_3 * h1_2
  h1_6 = h1_3 * h1_3

  h2_2 = h2 * h2
  h2_3 = h2_2 * h2
  h2_4 = h2_2 * h2_2
  h2_5 = h2_3 * h2_2
  h2_6 = h2_3 * h2_3

  g   = h0 + h1
  g_2 = g * g
  g_3 = g * g_2
  g_4 = g_2 * g_2
  g_5 = g_4 * g
  g_6 = g_3 * g_3

  h2ph3   = h2 + h3
  h2ph3_2 = h2ph3 * h2ph3
  h2ph3_3 = h2ph3_2 * h2ph3
  h2ph3_4 = h2ph3_2 * h2ph3_2
  h2ph3_5 = h2ph3_3 * h2ph3_2

  d2 = ( h1_2 - g_2 ) / h0
  d3 = ( h1_3 - g_3 ) / h0
  d4 = ( h1_4 - g_4 ) / h0
  d5 = ( h1_5 - g_5 ) / h0
  d6 = ( h1_6 - g_6 ) / h0

  g   = h2 + h3
  g_2 = g * g
  g_3 = g * g_2
  g_4 = g_2 * g_2
  g_5 = g_4 * g
  g_6 = g_3 * g_3

  n2 = ( g_2 - h2_2 ) / h3
  n3 = ( g_3 - h2_3 ) / h3
  n4 = ( g_4 - h2_4 ) / h3
  n5 = ( g_5 - h2_5 ) / h3
  n6 = ( g_6 - h2_6 ) / h3

  ! Compute matrix entries
  asys(1,1) = 1.0
  asys(1,2) = 1.0
  asys(1,3) = -1.0
  asys(1,4) = -1.0
  asys(1,5) = -1.0
  asys(1,6) = -1.0

  asys(2,1) =   0.0
  asys(2,2) = h2ph3
  asys(2,3) =   -0.5 * d2
  asys(2,4) =   0.5 * h1
  asys(2,5) =   -0.5 * h2
  asys(2,6) =   -0.5 * n2

  asys(3,1) =   0.0
  asys(3,2) = 0.5 * h2ph3_2
  asys(3,3) =   d3 / 6.0
  asys(3,4) =   - h1_2 / 6.0
  asys(3,5) =   - h2_2 / 6.0
  asys(3,6) =   - n3 / 6.0

  asys(4,1) =   0.0
  asys(4,2) = h2ph3_3 / 6.0
  asys(4,3) =   - d4 / 24.0
  asys(4,4) =   h1_3 / 24.0
  asys(4,5) =   - h2_3 / 24.0
  asys(4,6) =   - n4 / 24.0

  asys(5,1) =   0.0
  asys(5,2) = h2ph3_4 / 24.0
  asys(5,3) =   d5 / 120.0
  asys(5,4) =   - h1_4 / 120.0
  asys(5,5) =   - h2_4 / 120.0
  asys(5,6) =   - n5 / 120.0

  asys(6,1) =   0.0
  asys(6,2) = h2ph3_5 / 120.0
  asys(6,3) =   - d6 / 720.0
  asys(6,4) =   h1_5 / 720.0
  asys(6,5) =   - h2_5 / 720.0
  asys(6,6) =   - n6 / 720.0

  bsys(:) = (/ -1.0, -h2, -0.5*h2_2, -h2_3/6.0, -h2_4/24.0, -h2_5/120.0 /)

  call solve_linear_system( asys, bsys, csys, 6 )

  alpha = csys(1)
  beta  = csys(2)
  a = csys(3)
  b = csys(4)
  c = csys(5)
  d = csys(6)

  tri_l(n) = alpha
  tri_d(n) = 1.0
  tri_u(n) = beta
  tri_b(n) = a * u(n-3) + b * u(n-2) + c * u(n-1) + d * u(n)

  ! Boundary conditions: right boundary
  g = max( hnegligible, hminfrac*sum(h(n-5:n)) )
  x(1) = 0.0
  do i = 2,7
    x(i) = x(i-1) + max( g, h(n-7+i) )
  end do

  do i = 1,6

    do j = 1,6
      asys(i,j) = ( (x(i+1)**j) - (x(i)**j) ) / j
    end do

    bsys(i) = u(n-6+i) * max( g, h(n-6+i) )

  end do

  call solve_linear_system( asys, bsys, csys, 6 )

  tri_l(n+1) = 0.0
  tri_d(n+1) = 1.0
  tri_u(n+1) = 0.0
  tri_b(n+1) = evaluation_polynomial( csys, 6, x(7) )      ! last edge value

  ! Solve tridiagonal system and assign edge values
  call solve_tridiagonal_system( tri_l, tri_d, tri_u, tri_b, tri_x, n+1 )

  do i = 2,n
    edge_values(i,1)   = tri_x(i)
    edge_values(i-1,2) = tri_x(i)
  end do
  edge_values(1,1) = tri_x(1)
  edge_values(n,2) = tri_x(n+1)

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

hminfrac

real, parameter regrid_edge_values::hminfrac = 1.e-5

private

Definition at line 36 of file regrid_edge_values.F90.

Referenced by edge_values_explicit_h4(), edge_values_implicit_h4(), and edge_values_implicit_h6().

real, parameter :: hminfrac    = 1.e-5  ! A minimum fraction for min(h)/(sum(h)

hnegligible

real, parameter regrid_edge_values::hnegligible = 1.e-10

private

Definition at line 35 of file regrid_edge_values.F90.

Referenced by edge_values_explicit_h2(), edge_values_explicit_h4(), edge_values_implicit_h4(), and edge_values_implicit_h6().

real, parameter :: hnegligible = 1.e-10 ! A cut-off minimum thickness for sum(h)