Home
last modified time | relevance | path

Searched refs:n_internal (Results 1 – 4 of 4) sorted by relevance

/dports/science/PETSc/petsc-3.14.1/src/ksp/pc/impls/bddc/
H A Dbddcschurs.c811 PetscInt n_internal; in PCBDDCSubSchursSetUp() local
828 ierr = ISGetSize(is_I,&n_internal);CHKERRQ(ierr); in PCBDDCSubSchursSetUp()
829 if (!n_internal) { /* UMFPACK gives error with 0 sized problems */ in PCBDDCSubSchursSetUp()
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/visualizer/
H A Dhecmw_vis_pvr_main.c260 calc_gradient(n_node, n_internal, n_elem, node, elem, node1, n_neighbor_pe, in HECMW_vis_pvr_rendering()
/dports/biology/phyml/phyml-3.3.20200621/src/
H A Dutilities.c7449 int i,n_connected,n_nonconnected,n1,n2,new_n,n_internal,n_external,n_available; in Generate_Random_Tree_From_Scratch() local
7575 n_internal = n_external = 0; in Generate_Random_Tree_From_Scratch()
7578 if(tree->a_nodes[i]->v[1]) internal_nodes[n_internal++] = tree->a_nodes[i]; in Generate_Random_Tree_From_Scratch()
7583 n_internal = n_external = 0; in Generate_Random_Tree_From_Scratch()
7593 tree->times->nd_t[i] = tmp[internal_nodes[n_internal]->num]; in Generate_Random_Tree_From_Scratch()
7594 tree->a_nodes[i] = internal_nodes[n_internal++]; in Generate_Random_Tree_From_Scratch()
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/common/
H A Dhecmw_dist_refine.c2388 static int *new_internal_list(int my_rank, int n, int n_internal, int *ID) { in new_internal_list() argument
2392 internal_list = (int *)HECMW_malloc(sizeof(int) * n_internal); in new_internal_list()