MAKE_BUTCHERARRAY.f90 File Reference

Go to the source code of this file.

Functions/Subroutines
subroutine	make_butcherarray (order, stages, a_low, b_low, c)
	Makes Butcher array for Runge-Kutta scheme.
subroutine	make_low_storage_coefficients (stages, a, b, c, a_low, b_low)
	Computes Low-storage memory coefficients for Runge-Kutta scheme.

Function/Subroutine Documentation

make_butcherarray()

subroutine make_butcherarray	(	integer*4	order,
		integer*4	stages,
		real*8, dimension(stages)	a_low,
		real*8, dimension(stages)	b_low,
		real*8, dimension(stages)	c
	)

Makes Butcher array for Runge-Kutta scheme.

Author

Ilario Mazzieri

Note

Compute low storage Butcher array for Runge-Kutta(p,s) time integration scheme

Date

September, 2013

Version

1.0

Parameters

[in]	order	p
[in]	stages	s
[out]	A_low	low storage Butcher array A
[out]	B_low	low storage Butcher array B
[out]	c	Butcher array c

Definition at line 35 of file MAKE_BUTCHERARRAY.f90.

          
     implicit none
     
     integer*4:: order, stages
     real*8, dimension(stages,stages) :: a
     real*8, dimension(stages) :: b, c, a_low, b_low
 
     a = 0; b = 0; c = 0; a_low = 0; b_low = 0;
     
     select case(order)   
 
        case(2)               
           ! RK(2,2)
           select case(stages)
              case(2)
                 c(2) = 1
                 b(1) = 0.5; b(2)=0.5
                 a(2,1) = 1
                 
                 call make_low_storage_coefficients(stages,a,b,c,a_low,b_low)
                 
              case default   
                  write(*,'(A)') 'RK scheme not implemented'
           end select               
        
        case(3)
           ! RK(3,3)
           select case(stages)
              case(3)
                 c(2) = 0.5; c(3) = 1
                 b(1) = 1.d0/6; b(2) = 2.d0/3; b(3) = 1.d0/6
                 a(2,1) = 0.5; 
                 a(3,1) = -1; a(3,2) = 2
                 
                 call make_low_storage_coefficients(stages,a,b,c,a_low,b_low)
                                  
 
              case default   
                  write(*,'(A)') 'RK scheme not implemented'
           end select                       
        
        case(4)
 
           select case(stages)
              ! RK(4,4)
              case(4)
                 c(2) = 0.5; c(3) = 0.5; c(4) = 1
                 b(1) = 1.d0/6; b(2) = 1.d0/3; b(3) = 1.d0/3; b(4) = 1.d0/6
                 a(2,1) = 0.5; 
                 a(3,2) = 0.5;
                 a(4,3) = 1;
                 
                 call make_low_storage_coefficients(stages,a,b,c,a_low,b_low)
               
                 
              case default   
                  write(*,'(A)') 'RK scheme not implemented'
                  
           end select                
       
       
      
       
       
        case default
           write(*,'(A)') 'RK scheme not implemented'
           
      end select    
           
     

References make_low_storage_coefficients().

Here is the call graph for this function:

make_low_storage_coefficients()

subroutine make_low_storage_coefficients	(	integer*4	stages,
		real*8, dimension(stages,stages)	a,
		real*8, dimension(stages)	b,
		real*8, dimension(stages)	c,
		real*8, dimension(stages)	a_low,
		real*8, dimension(stages)	b_low
	)

Computes Low-storage memory coefficients for Runge-Kutta scheme.

Author

Ilario Mazzieri

Note

Compute low storage Butcher array for Runge-Kutta(p,s) time integration scheme where p is the order of the scheme and s is the number of stages

Date

September, 2013

Version

1.0

Parameters

[in]	stages	s
[in]	A	Butcher array
[in]	b	Butcher array
[in]	c	Butcher array
[out]	A_low	low storage Butcher array A
[out]	B_low	low storage Butcher array B

Definition at line 126 of file MAKE_BUTCHERARRAY.f90.

     
     implicit none
     
     integer*4:: stages
     real*8, dimension(stages,stages) :: a
     real*8, dimension(stages) :: b, c, a_low, b_low
     integer*4 :: i
     
 
     ! Compute Low storage coefficients according to the
     ! paper Toulorge and Desmet: "Optimal Runge-Kutta schemes for discontinuous
     ! Galerkin space discretizations applied to wave propagation problems"
     
     a_low(1) = 0;
     
     do i = 1, stages -1
        b_low(i) = a(i+1,i)
     enddo
     b_low(stages) = b(stages)
    
     do i = 2, stages 
        if (b(i) .ne. 0.d0) then
           a_low(i) = (b(i-1) - b_low(i-1))/b(i);
        else
           a_low(i) = (a(i+1,i-1) - c(i))/b_low(i);
        endif
     enddo   
        
     

Referenced by make_butcherarray().

Here is the caller graph for this function: