QR_MUMPS
|
Go to the source code of this file.
Functions/Subroutines | |
subroutine | dqrm_activate_front (qrm_mat, fnum, flops) |
This routine activates a front. More... | |
subroutine | dqrm_clean_front (qrm_mat, fnum) |
This routine performs the cleaning of a front. More... | |
subroutine | dqrm_store_h (front) |
subroutine | dqrm_store_r (front) |
subroutine dqrm_activate_front | ( | type(dqrm_spmat_type), target | qrm_mat, |
integer | fnum, | ||
real(kind(1.d0)) | flops | ||
) |
This routine activates a front.
The activation of a front implies the treatment of all the small subtrees rooted at the front's children. Small trees are recognizable since their root is flagged with a 1 in the adatasmall array
[in,out] | qrm_mat | the whole problem. this obviously contains the fornt to be activate |
[in] | fnum | the id of the front to be activated |
[in,out] | flops | a counter for flops. this is updated wrt to the flops performed so far |
Definition at line 53 of file dqrm_activate_front.F90.
References dqrm_clean_front(), dqrm_do_subtree(), and dqrm_init_front().
Referenced by activate().
subroutine dqrm_clean_front | ( | type(dqrm_spmat_type), target | qrm_mat, |
integer | fnum | ||
) |
This routine performs the cleaning of a front.
Cleaning a front means saving the parts corresponding tot he R and Q factors, and then freeing all the memory that is not needed anymore
[in,out] | qrm_mat | the whole problem. this obviously contains the fornt to be cleaned |
[in] | fnum | the id of the front to be activated |
Definition at line 148 of file dqrm_activate_front.F90.
References dqrm_store_h(), and dqrm_store_r().
Referenced by clean(), dqrm_activate_front(), and dqrm_do_subtree().
subroutine dqrm_store_h | ( | type(dqrm_front_type) | front | ) |
Definition at line 338 of file dqrm_activate_front.F90.
Referenced by dqrm_clean_front().
subroutine dqrm_store_r | ( | type(dqrm_front_type) | front | ) |
Definition at line 413 of file dqrm_activate_front.F90.
Referenced by dqrm_clean_front().