public subroutine ReD_Glk_CSLP_gmres(mg_solve, grid, maximum_iterations)
This is a rountine to solve a coarse grid CSLP system approximately by using GMRES
The CSLP operator is defined by ReD-Glk scheme
CSLP operator by ReD-Glk
Be careful!!, after the whole iteration without achieving eps, then the value of j will be "m_iter+1".So we need a k.
Attention: h_(i,j)=(w,v_i)=v^H*w, for complex value, so the code should be dot_product(v_i,w)
---call back_substitute(H,beta,k)---------------------------------
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.
Nodes of different colours represent the following:
Solid arrows point from a procedure to one which it calls. Dashed
arrows point from an interface to procedures which implement that interface.
This could include the module procedures in a generic interface or the
implementation in a submodule of an interface in a parent module.