hecmw_mf_graph Module Reference

Compressed (node level) graph of a block sparse matrix for the multifrontal solver. More...

Functions/Subroutines
subroutine, public	hecmw_mf_graph_from_hecmat (hecMAT, graph)
	Build the node graph from the nonzero pattern of hecMAT (values are not referenced). All NP nodes are used, as the built-in direct solver does, so the graph covers the external nodes too. More...
subroutine, public	hecmw_mf_graph_set (graph, nnode, ndof, xadj, adjncy)
	Build the node graph from explicit arrays (synthetic graphs in tests). More...
subroutine, public	hecmw_mf_graph_finalize (graph)

Detailed Description

Compressed (node level) graph of a block sparse matrix for the multifrontal solver.

Function/Subroutine Documentation

hecmw_mf_graph_finalize()

subroutine, public hecmw_mf_graph::hecmw_mf_graph_finalize

(

type(hecmwst_mf_graph), intent(inout)

graph

)

Definition at line 89 of file hecmw_mf_graph.f90.

Here is the caller graph for this function:

hecmw_mf_graph_from_hecmat()

subroutine, public hecmw_mf_graph::hecmw_mf_graph_from_hecmat	(	type(hecmwst_matrix), intent(in)	hecMAT,
		type(hecmwst_mf_graph), intent(out)	graph
	)

Build the node graph from the nonzero pattern of hecMAT (values are not referenced). All NP nodes are used, as the built-in direct solver does, so the graph covers the external nodes too.

Definition at line 32 of file hecmw_mf_graph.f90.

Here is the caller graph for this function:

hecmw_mf_graph_set()

subroutine, public hecmw_mf_graph::hecmw_mf_graph_set	(	type(hecmwst_mf_graph), intent(out)	graph,
		integer(kind=kint), intent(in)	nnode,
		integer(kind=kint), dimension(:), intent(in)	ndof,
		integer(kind=kint), dimension(:), intent(in)	xadj,
		integer(kind=kint), dimension(:), intent(in)	adjncy
	)

Build the node graph from explicit arrays (synthetic graphs in tests).

Definition at line 66 of file hecmw_mf_graph.f90.