|
QR_MUMPS
|
Go to the source code of this file.
Functions/Subroutines | |
| subroutine | dqrm_do_subtree (qrm_mat, fnum, flops) |
| This subroutine does the sequential factorization of an entire subtree. More... | |
| subroutine | sequential_fct (front, flops) |
| subroutine dqrm_do_subtree | ( | type(dqrm_spmat_type), target | qrm_mat, |
| integer | fnum, | ||
| real(kind(1.d0)) | flops | ||
| ) |
This subroutine does the sequential factorization of an entire subtree.
| [in,out] | qrm_mat | the whole problem data structure |
| [in] | fnum | the id of the root of the subtree |
| [in,out] | flops | a counter for the flops which is updated |
Definition at line 47 of file dqrm_do_subtree.F90.
References dqrm_clean_front(), dqrm_init_front(), dqrm_fdata_mod::qrm_done_, dqrm_fdata_mod::qrm_factorized_, qrm_nb_, dqrm_fdata_mod::qrm_ready_, and sequential_fct().
Referenced by dqrm_activate_front().
| subroutine dqrm_do_subtree::sequential_fct | ( | type(dqrm_front_type) | front, |
| real(kind(1.d0)) | flops | ||
| ) |
Definition at line 162 of file dqrm_do_subtree.F90.
Referenced by _qrm_do_subtree(), and dqrm_do_subtree().
1.8.11