/[escript]/branches/doubleplusgood/dudley/src/Mesh.cpp
ViewVC logotype

Contents of /branches/doubleplusgood/dudley/src/Mesh.cpp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1062 - (show annotations)
Mon Mar 26 06:17:53 2007 UTC (11 years, 11 months ago) by gross
Original Path: trunk/finley/src/Mesh.c
File MIME type: text/plain
File size: 11913 byte(s)
reduced integration schemes are implemented now for grad, integrate, etc. Tests still to be added.
1 /*
2 ************************************************************
3 * Copyright 2006 by ACcESS MNRF *
4 * *
5 * http://www.access.edu.au *
6 * Primary Business: Queensland, Australia *
7 * Licensed under the Open Software License version 3.0 *
8 * http://www.opensource.org/licenses/osl-3.0.php *
9 * *
10 ************************************************************
11 */
12
13
14 /**************************************************************/
15
16 /* Finley: Mesh */
17
18 /**************************************************************/
19
20 /* Author: gross@access.edu.au */
21 /* Version: $Id$ */
22
23 /**************************************************************/
24
25 #include "Mesh.h"
26
27 /**************************************************************/
28
29 /* allocates a Mesh with name name for elements of type id using an integration order. If order is negative, */
30 /* the most appropriate order is selected indepently. */
31
32 extern Finley_RefElementInfo Finley_RefElement_InfoList[];
33
34 #ifndef PASO_MPI
35 Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order, index_t reduced_order)
36 #else
37 Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order, index_t reduced_order, Paso_MPIInfo *mpi_info)
38 #endif
39 {
40 Finley_Mesh *out;
41
42 /* allocate the return value */
43
44 out=MEMALLOC(1,Finley_Mesh);
45 if (Finley_checkPtr(out)) return NULL;
46 out->Name=NULL;
47 out->Nodes=NULL;
48 out->Elements=NULL;
49 out->FaceElements=NULL;
50 out->Points=NULL;
51 out->ContactElements=NULL;
52 out->TagMap=NULL;
53 out->reference_counter=0;
54
55 out->FullFullPattern=NULL;
56 out->FullReducedPattern=NULL;
57 out->ReducedFullPattern=NULL;
58 out->ReducedReducedPattern=NULL;
59
60 #ifdef PASO_MPI
61 out->MPIInfo = NULL;
62
63 /* get MPI info */
64 out->MPIInfo = Paso_MPIInfo_getReference( mpi_info );
65 if (! Finley_noError()) {
66 Finley_Mesh_dealloc(out);
67 return NULL;
68 }
69 #endif
70 /* copy name: */
71
72 out->Name=MEMALLOC(strlen(name)+1,char);
73 if (Finley_checkPtr(out->Name)) {
74 Finley_Mesh_dealloc(out);
75 return NULL;
76 }
77 strcpy(out->Name,name);
78
79 /* allocate node table: */
80 #ifdef PASO_MPI
81 out->Nodes=Finley_NodeFile_alloc( numDim, mpi_info );
82 #else
83 out->Nodes=Finley_NodeFile_alloc(numDim);
84 #endif
85 if (! Finley_noError()) {
86 Finley_Mesh_dealloc(out);
87 return NULL;
88 }
89 out->order=order;
90 out->reduced_order=reduced_order;
91 out->Elements=NULL;
92 out->FaceElements=NULL;
93 out->Points=NULL;
94 out->ContactElements=NULL;
95 out->reference_counter++;
96 return out;
97 }
98
99 /* returns a reference to Finley_Mesh in */
100
101 Finley_Mesh* Finley_Mesh_reference(Finley_Mesh* in) {
102 if (in!=NULL) ++(in->reference_counter);
103 return in;
104 }
105
106 /* deallocates a mesh: */
107
108 void Finley_Mesh_dealloc(Finley_Mesh* in) {
109 if (in!=NULL) {
110 in->reference_counter--;
111 if (in->reference_counter<1) {
112 #ifdef Finley_TRACE
113 if (in->Name!=NULL) {
114 printf("Finley_Mesh_dealloc: mesh %s is deallocated.\n",in->Name);
115 } else {
116 printf("Finley_Mesh_dealloc\n");
117 }
118 #endif
119 MEMFREE(in->Name);
120 Finley_NodeFile_dealloc(in->Nodes);
121 Finley_ElementFile_dealloc(in->Elements);
122 Finley_ElementFile_dealloc(in->FaceElements);
123 Finley_ElementFile_dealloc(in->ContactElements);
124 Finley_ElementFile_dealloc(in->Points);
125 Finley_TagMap_free(in->TagMap);
126 Paso_SystemMatrixPattern_dealloc(in->FullFullPattern);
127 Paso_SystemMatrixPattern_dealloc(in->FullReducedPattern);
128 Paso_SystemMatrixPattern_dealloc(in->ReducedFullPattern);
129 Paso_SystemMatrixPattern_dealloc(in->ReducedReducedPattern);
130 #ifdef PASO_MPI
131 Paso_MPIInfo_dealloc( in->MPIInfo );
132 #endif
133 MEMFREE(in);
134 }
135 }
136 }
137
138 /**************************************************************/
139
140 /* returns the spatial dimension of the mesh: */
141
142 dim_t Finley_Mesh_getDim(Finley_Mesh *in) {
143 return in->Nodes->numDim;
144 }
145
146 /**************************************************************/
147
148 /* returns the number of nodes in the mesh: */
149
150 dim_t Finley_Mesh_getNumNodes(Finley_Mesh *in) {
151 return in->Nodes->numNodes;
152 }
153 /**************************************************************/
154
155 /* returns the number of degrees of freedom in the mesh: */
156
157 dim_t Finley_Mesh_getNumDegreesOfFreedom(Finley_Mesh *in) {
158 return in->Nodes->numDegreesOfFreedom;
159 }
160 /**************************************************************/
161
162 /* returns the number of degrees of freedom in the mesh: */
163
164 dim_t Finley_Mesh_getReducedNumDegreesOfFreedom(Finley_Mesh *in) {
165 return in->Nodes->reducedNumDegreesOfFreedom;
166 }
167
168 #ifdef PASO_MPI
169 void print_mesh_statistics( Finley_Mesh *out, bool_t reduced )
170 {
171 index_t i, r, j, N, M, dim;
172 int *ref;
173 dim = out->Nodes->numDim;
174
175 if( !reduced ){
176 printf( "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nMESH STATISTICS\n\nFULL MESH\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n" );
177 printf( "\nNodes\n========\n\n" );
178 printf( "\t%d internal DOF\n\t%d boundary DOF\n\t%d local DOF\n\t%d external DOF\n", out->Nodes->degreeOfFreedomDistribution->numInternal, out->Nodes->degreeOfFreedomDistribution->numBoundary, out->Nodes->degreeOfFreedomDistribution->numLocal, out->Nodes->degreeOfFreedomDistribution->numExternal);
179 for( i=0; i<out->Nodes->numNodes; i++ ){
180 printf( "node %d\t: id %d \tDOF %d \t: tag %d \t: Dom %d \t: coordinates [%3g", i, out->Nodes->Id[i], out->Nodes->degreeOfFreedom[i], out->Nodes->Tag[i], out->Nodes->Dom[i], out->Nodes->Coordinates[INDEX2(0,i,dim)] );
181 for( j=1; j<dim; j++ )
182 printf( ", %3g", out->Nodes->Coordinates[INDEX2(j,i,dim)]);
183 printf( " ]\n" );
184 }
185
186 printf( "Elements\n=========\n\n" );
187 printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->Elements->elementDistribution->numInternal, out->Elements->elementDistribution->numBoundary, out->Elements->elementDistribution->numLocal );
188 N = out->Elements->ReferenceElement->Type->numNodes;
189 for( i=0; i<out->Elements->numElements; i++ ){
190 printf( "element %d \t: id %d \t: dom %d \t: nodes [ %2d", i, out->Elements->Id[i], out->Elements->Dom[i], out->Elements->Nodes[INDEX2(0,i,N)] );
191 for( j=1; j<N; j++ )
192 printf( ", %2d", out->Elements->Nodes[INDEX2(j,i,N)]);
193 printf( " ] -> " );
194 if( N>8 )
195 printf( "\n\t\t\t\t\t\t" );
196 printf( ": DOF [ %2d", out->Nodes->degreeOfFreedom[out->Elements->Nodes[INDEX2(0,i,N)]] );
197 for( j=1; j<N; j++ )
198 printf( ", %2d", out->Nodes->degreeOfFreedom[out->Elements->Nodes[INDEX2(j,i,N)]]);
199 printf( " ]\n" );
200 }
201
202 printf( "\nFace Elements\n==========\n\n" );
203 printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->FaceElements->elementDistribution->numInternal, out->FaceElements->elementDistribution->numBoundary, out->FaceElements->elementDistribution->numLocal );
204 N = out->FaceElements->ReferenceElement->Type->numNodes;
205 for( i=0; i<out->FaceElements->numElements; i++ ){
206 printf( "face element %d \t: id %d \t: dom %d \t: nodes [ %2d", i, out->FaceElements->Id[i], out->FaceElements->Dom[i], out->FaceElements->Nodes[INDEX2(0,i,N)] );
207 for( j=1; j<N; j++ )
208 printf( ", %2d", out->FaceElements->Nodes[INDEX2(j,i,N)] );
209 printf( " ] -> " );
210 if( N>8 )
211 printf( "\n\t\t\t\t\t\t" );
212 printf( ": DOF [ %2d", out->Nodes->degreeOfFreedom[out->FaceElements->Nodes[INDEX2(0,i,N)]]);
213 for( j=1; j<N; j++ )
214 printf( ", %2d", out->Nodes->degreeOfFreedom[out->FaceElements->Nodes[INDEX2(j,i,N)]]);
215 printf( " ]\n" );
216 }
217 printf( "\nDistribution Data\n==========\n\n" );
218 Finley_NodeDistribution_print( out->Nodes->degreeOfFreedomDistribution, stdout );
219 }
220 else{
221 printf( "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nMESH STATISTICS\n\nREDUCED MESH\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n" );
222 printf( "\nNodes\n========\n\n" );
223 printf( "\t%d internal DOF\n\t%d boundary DOF\n\t%d local DOF\n\t%d external DOF\n", out->Nodes->reducedDegreeOfFreedomDistribution->numInternal, out->Nodes->reducedDegreeOfFreedomDistribution->numBoundary, out->Nodes->reducedDegreeOfFreedomDistribution->numLocal, out->Nodes->reducedDegreeOfFreedomDistribution->numExternal);
224 for( i=0, r=0; i<out->Nodes->numNodes; i++ ){
225 if( out->Nodes->toReduced[i]>=0 ){
226 printf( "node %d \t: id %d \tDOF %d \t: tag %d \t: Dom %d \t: coordinates [%3g", r, out->Nodes->Id[i], out->Nodes->reducedDegreeOfFreedom[i], out->Nodes->Tag[i], out->Nodes->Dom[i], out->Nodes->Coordinates[INDEX2(0,i,dim)] );
227 for( j=1; j<dim; j++ )
228 printf( ", %3g", out->Nodes->Coordinates[INDEX2(j,i,dim)]);
229 printf( " ]\n" );
230 r++;
231 }
232 }
233
234 printf( "Elements\n=========\n\n" );
235 printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->Elements->elementDistribution->numInternal, out->Elements->elementDistribution->numBoundary, out->Elements->elementDistribution->numLocal );
236 N = out->Elements->LinearReferenceElement->Type->numNodes;
237 M = out->Elements->ReferenceElement->Type->numNodes;
238 ref = out->Elements->ReferenceElement->Type->linearNodes;
239 for( i=0; i<out->Elements->numElements; i++ ){
240 printf( "element %d \t: id %d \t: dom %d \t: nodes [ %3d", i, out->Elements->Id[i], out->Elements->Dom[i], out->Nodes->toReduced[out->Elements->Nodes[INDEX2(ref[0],i,M)]] );
241 for( j=1; j<N; j++ ){
242 printf( ", %3d", out->Nodes->toReduced[out->Elements->Nodes[INDEX2(ref[j],i,M)]] );
243 }
244 printf( " ] DOF [ %3d", out->Nodes->reducedDegreeOfFreedom[out->Elements->Nodes[INDEX2(ref[0],i,M)]] );
245 for( j=1; j<N; j++ )
246 printf( ", %3d", out->Nodes->reducedDegreeOfFreedom[out->Elements->Nodes[INDEX2(ref[j],i,M)]]);
247 printf( " ]\n" );
248 }
249
250 printf( "\nFace Elements\n=================================================\n\n" );
251 printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->FaceElements->elementDistribution->numInternal, out->FaceElements->elementDistribution->numBoundary, out->FaceElements->elementDistribution->numLocal );
252 N = out->FaceElements->LinearReferenceElement->Type->numNodes;
253 M = out->FaceElements->ReferenceElement->Type->numNodes;
254 ref = out->FaceElements->ReferenceElement->Type->linearNodes;
255 for( i=0; i<out->FaceElements->numElements; i++ ){
256 printf( "face element %d \t: id %d \t: dom %d \t: nodes [ %3d", i, out->FaceElements->Id[i], out->FaceElements->Dom[i], out->Nodes->toReduced[out->FaceElements->Nodes[INDEX2(ref[0],i,M)]] );
257 for( j=1; j<N; j++ )
258 printf( ", %3d", out->Nodes->toReduced[out->FaceElements->Nodes[INDEX2(j,i,M)]] );
259 printf( " ] DOF [ %3d", out->Nodes->reducedDegreeOfFreedom[out->FaceElements->Nodes[INDEX2(ref[0],i,M)]]);
260 for( j=1; j<N; j++ )
261 printf( ", %3d", out->Nodes->reducedDegreeOfFreedom[out->FaceElements->Nodes[INDEX2(j,i,M)]]);
262 printf( " ]\n" );
263 }
264
265 printf( "\nDistribution Data\n==================\n\n" );
266 Finley_NodeDistribution_print( out->Nodes->reducedDegreeOfFreedomDistribution, stdout );
267 }
268 }
269 #endif
270 /*
271 * $Log$
272 * Revision 1.6 2005/09/15 03:44:22 jgs
273 * Merge of development branch dev-02 back to main trunk on 2005-09-15
274 *
275 * Revision 1.5.2.1 2005/09/07 06:26:19 gross
276 * the solver from finley are put into the standalone package paso now
277 *
278 * Revision 1.5 2005/07/08 04:07:51 jgs
279 * Merge of development branch back to main trunk on 2005-07-08
280 *
281 * Revision 1.4 2004/12/15 07:08:32 jgs
282 * *** empty log message ***
283 * Revision 1.1.1.1.2.3 2005/06/29 02:34:51 gross
284 * some changes towards 64 integers in finley
285 *
286 * Revision 1.1.1.1.2.2 2004/11/24 01:37:13 gross
287 * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now
288 *
289 *
290 *
291 */

Properties

Name Value
svn:eol-style native
svn:keywords Author Date Id Revision

  ViewVC Help
Powered by ViewVC 1.1.26