d_bpack_structure Module Reference

Functions/Subroutines
integer function	d_near_or_far_user (group_m, group_n, msh, option, ker, para)
integer function	d_near_or_far_geo (group_m, group_n, msh, option, ker, para)
integer function	d_near_or_far_user_md (group_m, group_n, Ndim, msh, option, ker, para)
integer function	d_near_or_far_geo_md (group_m, group_n, Ndim, msh, option, ker, para)
real(kind=8) function	d_distance_user (edgem, edgen, ker, msh, option, ptree, stats)
real(kind=8) function	d_distance_geo (edgem, edgen, ker, msh, option, ptree, stats)
real(kind=8) function	d_distance_gram (edgem, edgen, ker, msh, option, ptree, stats)
	**** l2 gram distance^2 between element edgem and edgen is More...
subroutine	d_distance_gram_block (nrow, ncol, rows, cols, dists, ker, msh, option, ptree, stats)
	**** l2 gram distance^2 between element edgem and edgen is More...
recursive subroutine	d_hmat_construct_local_tree (blocks, option, stats, msh, ker, ptree, Maxlevel)
subroutine	d_cluster_partition (bmat, option, msh, ker, stats, ptree)
subroutine	d_cluster_partition_md (Ndim, bmat, option, msh, ker, stats, ptree)
subroutine	d_findknns (option, msh, ker, stats, ptree, groupm_start, groupn_start)
recursive subroutine	d_append_nlist (ker, option, stats, msh, ptree, group_m, group_n, flag, Bidxs, Bidxe)
subroutine	d_bpack_structuring (bmat, option, msh, ker, ptree, stats)
subroutine	d_bpack_structuring_md (Ndim, bmat, option, msh, ker, ptree, stats)
subroutine	d_hss_md_structuring (Ndim, hss_bf1_md, option, msh, ker, ptree, stats)
subroutine	d_hss_structuring (hss_bf1, option, msh, ker, ptree, stats)
subroutine	d_hodlr_structuring (ho_bf1, option, msh, ker, ptree, stats)
subroutine	d_hmat_structuring (h_mat, option, msh, ker, ptree, stats)
recursive subroutine	d_hmat_assign_admissible (h_mat, group_m, group_n, level, option, stats, msh, ker, ptree)
subroutine	d_hmat_compute_colorset (h_mat, option, stats, msh, ker, ptree)

Function/Subroutine Documentation

d_append_nlist()

recursive subroutine d_bpack_structure::d_append_nlist	(	type(d_kernelquant)	ker,
		type(d_hoption)	option,
		type(d_hstat)	stats,
		type(d_mesh)	msh,
		type(d_proctree)	ptree,
		integer	group_m,
		integer	group_n,
		integer	flag,
		integer	Bidxs,
		integer	Bidxe
	)

Here is the call graph for this function:

d_bpack_structuring()

subroutine d_bpack_structure::d_bpack_structuring	(	type(d_bmatrix)	bmat,
		type(d_hoption)	option,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_bpack_structuring_md()

subroutine d_bpack_structure::d_bpack_structuring_md	(	integer	Ndim,
		type(d_bmatrix)	bmat,
		type(d_hoption)	option,
		type(d_mesh), dimension(ndim)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_cluster_partition()

subroutine d_bpack_structure::d_cluster_partition	(	type(d_bmatrix)	bmat,
		type(d_hoption)	option,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_hstat)	stats,
		type(d_proctree)	ptree
	)

*************Initialize permutation vector ********

************Compute Maxlevel of BPACK tree*******************

************** check whether the sorting option is valid

---

**** construct the top few levels whose ordering is provided by the user

***** the following is needed for the near_or_far function in H matrix, this needs to be improved

**** if necessary, continue ordering the sub-trees using clustering method specified by optionxyzsort

**** generate tree structures on other processes

**********Dump the ordering into a file********************************

**** construct a d_list of k-nearest neighbours for each point

Here is the call graph for this function:

d_cluster_partition_md()

subroutine d_bpack_structure::d_cluster_partition_md	(	integer	Ndim,
		type(d_bmatrix)	bmat,
		type(d_hoption)	option,
		type(d_mesh), dimension(ndim)	msh,
		type(d_kernelquant)	ker,
		type(d_hstat)	stats,
		type(d_proctree)	ptree
	)

*************Initialize permutation vector ********

************Compute Maxlevel of BPACK tree*******************

************** check whether the sorting option is valid

---

**** construct the top few levels whose ordering is provided by the user

***** the following is needed for the near_or_far function in H matrix, this needs to be improved

**** if necessary, continue ordering the sub-trees using clustering method specified by optionxyzsort

**** generate tree structures on other processes

**** construct a d_list of k-nearest neighbours for each point

Here is the call graph for this function:

d_distance_geo()

real(kind=8) function d_bpack_structure::d_distance_geo	(	integer	edgem,
		integer	edgen,
		type(d_kernelquant)	ker,
		type(d_mesh)	msh,
		type(d_hoption)	option,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_distance_gram()

real(kind=8) function d_bpack_structure::d_distance_gram	(	integer	edgem,
		integer	edgen,
		type(d_kernelquant)	ker,
		type(d_mesh)	msh,
		type(d_hoption)	option,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

**** l2 gram distance^2 between element edgem and edgen is

**** angular gram distance^2 is

d_distance_gram_block()

subroutine d_bpack_structure::d_distance_gram_block	(	integer	nrow,
		integer	ncol,
		integer, dimension(nrow)	rows,
		integer, dimension(ncol)	cols,
		real*8, dimension(nrow, ncol)	dists,
		type(d_kernelquant)	ker,
		type(d_mesh)	msh,
		type(d_hoption)	option,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

**** l2 gram distance^2 between element edgem and edgen is

**** angular gram distance^2 is

d_distance_user()

real(kind=8) function d_bpack_structure::d_distance_user	(	integer	edgem,
		integer	edgen,
		type(d_kernelquant)	ker,
		type(d_mesh)	msh,
		type(d_hoption)	option,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_findknns()

subroutine d_bpack_structure::d_findknns	(	type(d_hoption)	option,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_hstat)	stats,
		type(d_proctree)	ptree,
		integer	groupm_start,
		integer	groupn_start
	)

Here is the call graph for this function:

d_hmat_assign_admissible()

recursive subroutine d_bpack_structure::d_hmat_assign_admissible	(	type(d_hmat)	h_mat,
		integer	group_m,
		integer	group_n,
		integer	level,
		type(d_hoption)	option,
		type(d_hstat)	stats,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree
	)

Here is the call graph for this function:

d_hmat_compute_colorset()

subroutine d_bpack_structure::d_hmat_compute_colorset	(	type(d_hmat)	h_mat,
		type(d_hoption)	option,
		type(d_hstat)	stats,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree
	)

Here is the call graph for this function:

d_hmat_construct_local_tree()

recursive subroutine d_bpack_structure::d_hmat_construct_local_tree	(	type(d_matrixblock)	blocks,
		type(d_hoption)	option,
		type(d_hstat)	stats,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		integer	Maxlevel
	)

Here is the call graph for this function:

d_hmat_structuring()

subroutine d_bpack_structure::d_hmat_structuring	(	type(d_hmat)	h_mat,
		type(d_hoption)	option,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

---

Here is the call graph for this function:

d_hodlr_structuring()

subroutine d_bpack_structure::d_hodlr_structuring	(	type(d_hobf)	ho_bf1,
		type(d_hoption)	option,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_hss_md_structuring()

subroutine d_bpack_structure::d_hss_md_structuring	(	integer	Ndim,
		type(d_hssbf_md)	hss_bf1_md,
		type(d_hoption)	option,
		type(d_mesh), dimension(ndim)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_hss_structuring()

subroutine d_bpack_structure::d_hss_structuring	(	type(d_hssbf)	hss_bf1,
		type(d_hoption)	option,
		type(d_mesh)	msh,
		type(d_kernelquant)	ker,
		type(d_proctree)	ptree,
		type(d_hstat)	stats
	)

Here is the call graph for this function:

d_near_or_far_geo()

integer function d_bpack_structure::d_near_or_far_geo	(	integer	group_m,
		integer	group_n,
		type(d_mesh)	msh,
		type(d_hoption)	option,
		type(d_kernelquant)	ker,
		real*8	para
	)

Here is the call graph for this function:

d_near_or_far_geo_md()

integer function d_bpack_structure::d_near_or_far_geo_md	(	integer, dimension(ndim)	group_m,
		integer, dimension(ndim)	group_n,
		integer	Ndim,
		type(d_mesh), dimension(ndim)	msh,
		type(d_hoption)	option,
		type(d_kernelquant)	ker,
		real*8	para
	)

d_near_or_far_user()

integer function d_bpack_structure::d_near_or_far_user	(	integer	group_m,
		integer	group_n,
		type(d_mesh)	msh,
		type(d_hoption)	option,
		type(d_kernelquant)	ker,
		real*8	para
	)

Here is the call graph for this function:

d_near_or_far_user_md()

integer function d_bpack_structure::d_near_or_far_user_md	(	integer, dimension(ndim)	group_m,
		integer, dimension(ndim)	group_n,
		integer	Ndim,
		type(d_mesh), dimension(ndim)	msh,
		type(d_hoption)	option,
		type(d_kernelquant)	ker,
		real*8	para
	)

Here is the call graph for this function: