Go to the source code of this file.
|
| subroutine, public | mod_amr_fct::prolong_2nd_stg (sCo, sFi, ixCoLin, ixFiLin, dxCoD, xCominD, dxFiD, xFiminD, ghost, fine_Lin) |
| | This subroutine performs a 2nd order prolongation for a staggered field F, preserving the divergence of the coarse cell. This is useful for preserving DivF=0. If DivF=f(x), a different algorithm must be used. More...
|
| |
| subroutine, public | mod_amr_fct::store_faces |
| | To achive consistency and thus conservation of divergence, when refining a block we take into account the faces of the already fine neighbours, if any. This routine stores them. More...
|
| |
| subroutine, public | mod_amr_fct::comm_faces |
| | When refining a coarse block with fine neighbours, it is necessary prolong consistently with the already fine faces. This routine takes care of the communication of such faces. More...
|
| |
| subroutine, public | mod_amr_fct::end_comm_faces |
| |
| subroutine, public | mod_amr_fct::deallocatebfaces |
| |
| subroutine, public | mod_amr_fct::old_neighbors (child_igrid, child_ipe, igrid, ipe) |
| |
| subroutine, public | mod_amr_fct::already_fine (sFi, ichild, fine_L) |
| | This routine fills the fine faces before prolonging. It is the face equivalent of fix_conserve. More...
|
| |
|
| type(facealloc), dimension(:,:,:), allocatable, public | mod_amr_fct::pface |
| |
| type(fake_neighbors), dimension(:^d &,:,:), allocatable, public | mod_amr_fct::fine_neighbors |
| |
| integer, dimension(:,:^d &,:), allocatable, public | mod_amr_fct::old_neighbor |
| |
