Home
last modified time | relevance | path

Searched refs:vertices (Results 1 – 25 of 130) sorted by relevance

123456

/petsc/config/BuildSystem/ !
H A Dgraph.py7 def __init__(self, vertices = []): argument
9 self.vertices = []
12 map(self.addVertex, vertices)
16 return len(self.vertices)
19 …return 'DirectedGraph with '+str(len(self.vertices))+' vertices and '+str(reduce(lambda k,l: k+l, …
25 if not vertex in self.vertices:
26 self.vertices.append(vertex)
62 if vertex in self.vertices:
63 self.vertices.remove(vertex)
66 for v in self.vertices:
[all …]
/petsc/src/mat/tutorials/ !
H A Dex18.c24 PetscCall(PetscMalloc1(3 * fe->Ne, &fe->vertices)); in CreateFEStruct()
26 fe->vertices[0 + 0] = 0; in CreateFEStruct()
27 fe->vertices[0 + 1] = 1; in CreateFEStruct()
28 fe->vertices[0 + 2] = 2; in CreateFEStruct()
29 fe->vertices[3 + 0] = 2; in CreateFEStruct()
30 fe->vertices[3 + 1] = 1; in CreateFEStruct()
31 fe->vertices[3 + 2] = 3; in CreateFEStruct()
32 fe->vertices[6 + 0] = 2; in CreateFEStruct()
33 fe->vertices[6 + 1] = 4; in CreateFEStruct()
34 fe->vertices[6 + 2] = 3; in CreateFEStruct()
[all …]
/petsc/src/snes/utils/dm/ !
H A Ddminterpolatesnes.c455 const PetscScalar *vertices = (const PetscScalar *)ctx; in QuadMap_Private() local
456 const PetscScalar x0 = vertices[0]; in QuadMap_Private()
457 const PetscScalar y0 = vertices[1]; in QuadMap_Private()
458 const PetscScalar x1 = vertices[2]; in QuadMap_Private()
459 const PetscScalar y1 = vertices[3]; in QuadMap_Private()
460 const PetscScalar x2 = vertices[4]; in QuadMap_Private()
461 const PetscScalar y2 = vertices[5]; in QuadMap_Private()
462 const PetscScalar x3 = vertices[6]; in QuadMap_Private()
463 const PetscScalar y3 = vertices[7]; in QuadMap_Private()
492 const PetscScalar *vertices = (const PetscScalar *)ctx; in QuadJacobian_Private() local
[all …]
/petsc/src/dm/impls/moab/tests/output/ !
H A Dex3_1.out7 Sizes: cells=8, vertices=9, blocks=1
9 cells=8, faces=8, vertices=8
15 Sizes: cells=32, vertices=25, blocks=1
17 cells=14, faces=16, vertices=16
23 Sizes: cells=128, vertices=81, blocks=1
25 cells=30, faces=32, vertices=32
H A Dex3_1_1.out7 Sizes: cells=8, vertices=9, blocks=1
9 cells=8, faces=8, vertices=8
15 Sizes: cells=32, vertices=25, blocks=1
17 cells=14, faces=16, vertices=16
23 Sizes: cells=128, vertices=81, blocks=1
25 cells=30, faces=32, vertices=32
H A Dex3_2_1.out7 Sizes: cells=8, vertices=27, blocks=1
9 cells=8, faces=12, vertices=17
15 Sizes: cells=64, vertices=125, blocks=1
17 cells=32, faces=64, vertices=57
23 Sizes: cells=512, vertices=729, blocks=1
25 cells=184, faces=256, vertices=193
H A Dex3_1_2.out7 Sizes: cells=8, vertices=27, blocks=1
9 cells=8, faces=24, vertices=26
15 Sizes: cells=64, vertices=125, blocks=1
17 cells=56, faces=96, vertices=75
23 Sizes: cells=512, vertices=729, blocks=1
25 cells=296, faces=384, vertices=263
/petsc/src/snes/tutorials/network/output/ !
H A Dex1_4.out10 Subnet 0: nEdges 9, nVertices(include shared vertices) 9
22 Subnet 1: nEdges 7, nVertices(include shared vertices) 7
39 Subnet 0: nEdges 4, nVertices(include shared vertices) 5
46 Subnet 0: nEdges 4, nVertices(include shared vertices) 5
52 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
54 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
60 Subnet 1: nEdges 4, nVertices(include shared vertices) 6
H A Dex1.out7 Subnet 0: nEdges 9, nVertices(include shared vertices) 9
17 Subnet 1: nEdges 7, nVertices(include shared vertices) 7
/petsc/src/ksp/ksp/tutorials/network/output/ !
H A Dex3_3.out5 Subnet 0: nEdges 3, nVertices(include shared vertices) 4
11 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
17 Subnet 2: nEdges 3, nVertices(include shared vertices) 4
23 Subnet 3: nEdges 3, nVertices(include shared vertices) 4
H A Dex4_3.out5 Subnet 0: nEdges 3, nVertices(include shared vertices) 4
11 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
17 Subnet 2: nEdges 3, nVertices(include shared vertices) 4
23 Subnet 3: nEdges 3, nVertices(include shared vertices) 4
H A Dex3_1.out5 Subnet 0: nEdges 3, nVertices(include shared vertices) 4
9 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
H A Dex4_1.out5 Subnet 0: nEdges 3, nVertices(include shared vertices) 4
9 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
H A Dex3_2.out5 Subnet 0: nEdges 3, nVertices(include shared vertices) 4
11 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
H A Dex4_2.out5 Subnet 0: nEdges 3, nVertices(include shared vertices) 4
11 Subnet 1: nEdges 3, nVertices(include shared vertices) 4
/petsc/src/dm/tests/output/ !
H A Dex10_1.out6 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
9 Subnet 0: nEdges 2, nVertices(include shared vertices) 3
30 Subnet 0: nEdges 2, nVertices(include shared vertices) 3
34 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
/petsc/src/dm/impls/network/tests/output/ !
H A Dex1_1.out6 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
9 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
27 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
30 Subnet 0: nEdges 1, nVertices(include shared vertices) 2
H A Dex2_1.out5 Subnet 0: nEdges 2, nVertices(include shared vertices) 3
9 Subnet 0: nEdges 2, nVertices(include shared vertices) 3
/petsc/src/dm/impls/plex/tests/output/ !
H A Dex1_0.out2 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Sorting vertices by a bsp-tree.
9 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Incrementally inserting vertices.
45 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 1.
52 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 2.
59 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 3.
66 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 4.
73 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 5.
80 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 6.
127 [0] <dm:plex> TetGenMeshMarkAcuteVertices(): Marking acute vertices.
129 [0] <dm:plex> TetGenMeshMarkAcuteVertices(): 0 acute vertices.
[all …]
/petsc/src/snes/tutorials/output/ !
H A Dex28_glvis_composite_da_1d.out31 vertices
109 vertices
/petsc/src/ts/tutorials/output/ !
H A Dex12_glvis_da_2d_vect.out145 vertices
777 vertices
H A Dex12_glvis_da_2d_vect_ll.out145 vertices
777 vertices
/petsc/src/dm/impls/plex/tutorials/output/ !
H A Dex1f90_1.out2 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Sorting vertices by a bsp-tree.
9 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Incrementally inserting vertices.
36 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 1.
42 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 2.
48 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 3.
54 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 4.
60 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 5.
66 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 6.
112 [0] <dm:plex> TetGenMeshMarkAcuteVertices(): Marking acute vertices.
114 [0] <dm:plex> TetGenMeshMarkAcuteVertices(): 0 acute vertices.
[all …]
H A Dex1_1.out2 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Sorting vertices by a bsp-tree.
9 [0] <dm:plex> TetGenMeshDelaunizeVertices(): Incrementally inserting vertices.
36 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 1.
42 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 2.
48 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 3.
54 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 4.
60 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 5.
66 [0] <dm:plex> TetGenMeshTriangulate(): 4 vertices, 4 segments, 0 holes, shmark: 6.
112 [0] <dm:plex> TetGenMeshMarkAcuteVertices(): Marking acute vertices.
114 [0] <dm:plex> TetGenMeshMarkAcuteVertices(): 0 acute vertices.
[all …]
/petsc/doc/manual/ !
H A Ddmnetwork.md38 …coupling information between subnetworks. That is vertices that are *shared* between multiple subn…
85 …`nsv` is the number of vertices shared by the two subnetworks, `asv` and `bsv` are the vertex indi…
96 and setting the number of variables to the vertices and edges.
124 vertices/edges) to multiple processors.
140 vertices/edges,
176 edges for a vertex or the connecting vertices covering an edge. These
180 DMNetworkGetConnectedVertices(DM dm, PetscInt edge, const PetscInt *vertices[]);
196 of accessing and retrieving the components and number of variables at vertices is:
213 used when different component types are set at different vertices. In

123456