Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 278) sorted by relevance

12345678910>>...12

/petsc/lib/petsc/bin/maint/
H A Dpetscdt_create_quadrature_headers.py65 nodes = sorted(B)
66 diffs = [b - a for (a,b) in zip(nodes[:-1],nodes[1:])]
68 rule['nodes'][i].append([nodes[-1], nodes[0]])
70 rule['nodes'][i].append([nodes[0], nodes[-1]])
116 nodes = sorted([w, x, y, z])
117 diffs = [b - a for (a,b) in zip(nodes[:-1],nodes[1:])]
119 rule['nodes'][i].append([nodes[-1], nodes[0]])
121 rule['nodes'][i].append([nodes[0], nodes[-1]])
123 nodes = sorted([w, x, y, z])
124 rule['nodes'][i].append([nodes[0], nodes[-1]])
[all …]
/petsc/src/dm/dt/dualspace/impls/lagrange/tests/output/
H A Dex1_3_wedge_continuous_trimmed.out2 All nodes:
12 All nodes:
26 All nodes:
37 All nodes:
51 All nodes:
61 All nodes:
68 All nodes:
97 Interior nodes:
101 All nodes:
141 Interior nodes:
[all …]
H A Dex1_3_simplex_continuous_full.out2 All nodes:
11 All nodes:
20 All nodes:
27 All nodes:
36 All nodes:
45 All nodes:
52 All nodes:
69 All nodes:
86 All nodes:
95 All nodes:
[all …]
H A Dex1_3_simplex_continuous_trimmed.out2 All nodes:
11 All nodes:
22 All nodes:
31 All nodes:
42 All nodes:
51 All nodes:
58 All nodes:
77 Interior nodes:
81 All nodes:
106 All nodes:
[all …]
H A Dex1_3_tensor_continuous_trimmed.out2 All nodes:
13 All nodes:
30 All nodes:
43 All nodes:
60 All nodes:
71 All nodes:
78 All nodes:
118 Interior nodes:
122 All nodes:
180 Interior nodes:
[all …]
H A Dex1_3_wedge_continuous_full.out2 All nodes:
11 All nodes:
20 All nodes:
27 All nodes:
36 All nodes:
45 All nodes:
52 All nodes:
75 All nodes:
98 All nodes:
109 All nodes:
[all …]
H A Dex1_3_tensor_continuous_full.out2 All nodes:
11 All nodes:
20 All nodes:
27 All nodes:
36 All nodes:
45 All nodes:
52 All nodes:
81 All nodes:
110 All nodes:
123 All nodes:
[all …]
H A Dex1_3_simplex_discontinuous_full.out2 All nodes:
11 All nodes:
20 All nodes:
27 All nodes:
36 All nodes:
45 All nodes:
52 All nodes:
70 All nodes:
88 All nodes:
98 All nodes:
[all …]
H A Dex1_3_wedge_discontinuous_full.out2 All nodes:
11 All nodes:
20 All nodes:
27 All nodes:
36 All nodes:
45 All nodes:
52 All nodes:
76 All nodes:
100 All nodes:
112 All nodes:
[all …]
H A Dex1_3_wedge_discontinuous_trimmed.out2 All nodes:
13 All nodes:
28 All nodes:
40 All nodes:
55 All nodes:
66 All nodes:
73 All nodes:
104 All nodes:
146 All nodes:
170 All nodes:
[all …]
H A Dex1_3_tensor_discontinuous_full.out2 All nodes:
11 All nodes:
20 All nodes:
27 All nodes:
36 All nodes:
45 All nodes:
52 All nodes:
82 All nodes:
112 All nodes:
126 All nodes:
[all …]
H A Dex1_3_simplex_discontinuous_trimmed.out2 All nodes:
12 All nodes:
24 All nodes:
34 All nodes:
46 All nodes:
56 All nodes:
63 All nodes:
84 All nodes:
110 All nodes:
126 All nodes:
[all …]
H A Dex1_3_tensor_discontinuous_trimmed.out2 All nodes:
14 All nodes:
32 All nodes:
46 All nodes:
64 All nodes:
76 All nodes:
83 All nodes:
125 All nodes:
185 All nodes:
218 All nodes:
[all …]
H A Dex1_1_continuous_full.out2 All nodes:
17 All nodes:
32 All nodes:
39 All nodes:
57 All nodes:
64 Interior nodes:
76 All nodes:
97 All nodes:
105 Interior nodes:
119 All nodes:
H A Dex1_1_continuous_trimmed.out2 All nodes:
9 All nodes:
24 All nodes:
31 Interior nodes:
43 All nodes:
61 All nodes:
69 Interior nodes:
83 All nodes:
H A Dex1_2_simplex_continuous_trimmed.out2 All nodes:
10 All nodes:
18 All nodes:
26 All nodes:
57 All nodes:
69 Interior nodes:
103 All nodes:
114 All nodes:
126 Interior nodes:
160 All nodes:
[all …]
H A Dex1_1_discontinuous_full.out2 All nodes:
17 All nodes:
32 All nodes:
50 All nodes:
68 All nodes:
89 All nodes:
110 All nodes:
134 All nodes:
/petsc/src/ksp/ksp/tutorials/
H A Dex68.c12 PetscErrorCode ComputeSolution(PetscInt n, PetscReal *nodes, PetscReal *weights, Vec x) in ComputeSolution() argument
22 xd = nodes[i]; in ComputeSolution()
33 PetscErrorCode ComputeRhs(PetscInt n, PetscReal *nodes, PetscReal *weights, Vec b) in ComputeRhs() argument
43 xd = nodes[i]; in ComputeRhs()
52 PetscReal *nodes; in main() local
82 PetscCall(PetscMalloc2(n, &nodes, n, &weights)); in main()
83 …DTGaussLobattoLegendreQuadrature(n, PETSCGAUSSLOBATTOLEGENDRE_VIA_LINEAR_ALGEBRA, nodes, weights)); in main()
87 PetscCall(PetscGaussLobattoLegendreElementLaplacianCreate(n, nodes, weights, &A)); in main()
93 PetscCall(ComputeRhs(n, nodes, weights, b)); in main()
105 PetscCall(ComputeSolution(n, nodes, weights, b)); in main()
[all …]
H A Dex69.c18 PetscReal *nodes; /* GLL nodes */ member
133 PetscCall(PetscMalloc2(n, &gll.nodes, n, &gll.weights)); in main()
134 …obattoLegendreQuadrature(n, PETSCGAUSSLOBATTOLEGENDRE_VIA_LINEAR_ALGEBRA, gll.nodes, gll.weights)); in main()
136 PetscCall(DMDASetGLLCoordinates(da, gll.n, gll.nodes)); in main()
141 PetscCall(PetscGaussLobattoLegendreElementLaplacianCreate(gll.n, gll.nodes, gll.weights, &A)); in main()
195 PetscCall(PetscGaussLobattoLegendreIntegrate(gll.n, gll.nodes, gll.weights, f, &norm)); in main()
209 PetscCall(PetscGaussLobattoLegendreElementLaplacianDestroy(gll.n, gll.nodes, gll.weights, &A)); in main()
210 PetscCall(PetscFree2(gll.nodes, gll.weights)); in main()
/petsc/src/ksp/pc/impls/bddc/
H A Dbddcgraph.c33 …if (graph->nodes[i].count > 1 && graph->nodes[i].special_dof == PCBDDCGRAPH_DIRICHLET_MARK) size++; in PCBDDCGraphGetDirichletDofsB()
39 …if (graph->nodes[i].count > 1 && graph->nodes[i].special_dof == PCBDDCGRAPH_DIRICHLET_MARK) dirdof… in PCBDDCGraphGetDirichletDofsB()
59 if (graph->nodes[i].special_dof == PCBDDCGRAPH_DIRICHLET_MARK) size++; in PCBDDCGraphGetDirichletDofs()
65 if (graph->nodes[i].special_dof == PCBDDCGRAPH_DIRICHLET_MARK) dirdofs_idxs[size++] = i; in PCBDDCGraphGetDirichletDofs()
94 …erASCIISynchronizedPrintf(viewer, " which_dof: %" PetscInt_FMT "\n", graph->nodes[i].which_dof)); in PCBDDCGraphASCIIView()
95 …CIISynchronizedPrintf(viewer, " special_dof: %" PetscInt_FMT "\n", graph->nodes[i].special_dof)); in PCBDDCGraphASCIIView()
96 …ViewerASCIISynchronizedPrintf(viewer, " shared by: %" PetscInt_FMT "\n", graph->nodes[i].count)); in PCBDDCGraphASCIIView()
98 if (graph->nodes[i].count) { in PCBDDCGraphASCIIView()
100 …for (j = 0; j < graph->nodes[i].count; j++) PetscCall(PetscViewerASCIISynchronizedPrintf(viewer, "… in PCBDDCGraphASCIIView()
105 …edPrintf(viewer, " number of local groups: %" PetscInt_FMT "\n", graph->nodes[i].local_groups_co… in PCBDDCGraphASCIIView()
[all …]
/petsc/src/sys/yaml/src/
H A Dloader.c94 if (!STACK_INIT(parser, document->nodes, yaml_node_t*)) in yaml_parser_load()
267 data.mark = parser->document->nodes.start[index-1].start_mark; in yaml_parser_register_anchor()
304 parent = &parser->document->nodes.start[parent_index-1]; in yaml_parser_load_node_add()
375 if (!STACK_LIMIT(parser, parser->document->nodes, INT_MAX-1)) goto error; in yaml_parser_load_scalar()
387 if (!PUSH(parser, parser->document->nodes, node)) goto error; in yaml_parser_load_scalar()
389 index = parser->document->nodes.top - parser->document->nodes.start; in yaml_parser_load_scalar()
420 if (!STACK_LIMIT(parser, parser->document->nodes, INT_MAX-1)) goto error; in yaml_parser_load_sequence()
434 if (!PUSH(parser, parser->document->nodes, node)) goto error; in yaml_parser_load_sequence()
436 index = parser->document->nodes.top - parser->document->nodes.start; in yaml_parser_load_sequence()
463 assert(parser->document->nodes.start[index-1].type == YAML_SEQUENCE_NODE); in yaml_parser_load_sequence_end()
[all …]
H A Dapi.c375 while (!STACK_EMPTY(&context, document->nodes)) { in yaml_document_delete()
376 yaml_node_t node = POP(&context, document->nodes); in yaml_document_delete()
392 STACK_DEL(&context, document->nodes); in yaml_document_delete()
415 …if (index > 0 && document->nodes.start + index <= document->nodes.top) return document->nodes.star… in yaml_document_get_node()
428 if (document->nodes.top != document->nodes.start) return document->nodes.start; in yaml_document_get_root_node()
/petsc/src/dm/impls/network/
H A Dnetworkmonitor.c119 …dd(DMNetworkMonitor monitor, const char *name, PetscInt element, PetscInt nodes, PetscInt start, P… in DMNetworkMonitorAdd() argument
153 else PetscCall(PetscDrawAxisSetLimits(axis, 0, nodes - 1, ymin, ymax)); in DMNetworkMonitorAdd()
157 PetscCall(VecCreateSeq(PETSC_COMM_SELF, nodes, &node->v)); in DMNetworkMonitorAdd()
160 node->nodes = nodes; in DMNetworkMonitorAdd()
195 for (i = 0; i < node->nodes; i++) vv[i] = xx[start + i * node->blocksize]; in DMNetworkMonitorView()
/petsc/share/petsc/bin/
H A Ddmnetwork_view.py213 def __init__(self, row, opts: DisplayOptions, nodes): argument
220 if not start in nodes:
222 self.startNode = nodes[start]
224 if not end in nodes:
226 self.endNode = nodes[end]
238 self.nodes = {}
243 nodePositions = np.zeros((len(self.nodes), 2))
244 nodeColors = np.zeros((len(self.nodes), 4))
250 for node in self.nodes.values():
306 sizes=np.ones(len(self.nodes)) * (20 ** 2),
[all …]
/petsc/src/dm/partitioner/impls/simple/
H A Dpartsimple.c47 const PetscInt *nodes = p->nodeGrid; in PetscPartitionerPartition_Simple_Grid() local
60 for (i = 0; i < 3; ++i) Np *= nodes[i] * procs[i]; in PetscPartitionerPartition_Simple_Grid()
64 for (i = 0; i < p->gridDim; ++i) cells[i] = nodes[i] * procs[i]; in PetscPartitionerPartition_Simple_Grid()
74nodes[i] * procs[i]) == 0, PETSC_COMM_SELF, PETSC_ERR_ARG_INCOMP, "dir %" PetscInt_FMT ". Number o… in PetscPartitionerPartition_Simple_Grid()
75 pcells[i] = cells[i] / (nodes[i] * procs[i]); in PetscPartitionerPartition_Simple_Grid()
85 for (nk = 0; nk < nodes[2]; ++nk) { in PetscPartitionerPartition_Simple_Grid()
86 for (nj = 0; nj < nodes[1]; ++nj) { in PetscPartitionerPartition_Simple_Grid()
87 for (ni = 0; ni < nodes[0]; ++ni) { in PetscPartitionerPartition_Simple_Grid()
88 const PetscInt nid = (nk * nodes[1] + nj) * nodes[0] + ni; in PetscPartitionerPartition_Simple_Grid()

12345678910>>...12