# Contents of /trunk/esys2/finley/src/finleyC/Assemble_handelShapeMissMatch.c

Revision 82 - (show annotations)
Tue Oct 26 06:53:54 2004 UTC (15 years, 5 months ago) by jgs
File MIME type: text/plain
File size: 5114 byte(s)
```Initial revision

```
 1 /* \$Id\$ */ 2 3 /**************************************************************/ 4 5 /* assemblage routines: */ 6 7 /* these routines handel cases where there ia a miss match in the number of nodes and the number of shape funtion: */ 8 9 /* _in: V[N,numNodes0,numNodes1] is reduced into V[N,numShapes0,numShapes1] */ 10 /* _out: V[N,numShapes0,numShapes1] is expanded into V[N,numNodes0,numNodes1] */ 11 /* in both cases the leading dimenisons are unchanged */ 12 13 14 /**************************************************************/ 15 16 /* Copyrights by ACcESS Australia, 2003,2004 */ 17 /* author: gross@access.edu.au */ 18 /* Version: \$Id\$ */ 19 20 /**************************************************************/ 21 22 #include "Common.h" 23 #include "Assemble.h" 24 25 26 /**************************************************************/ 27 28 /* this takes the mean value: */ 29 30 void Finley_Assemble_handelShapeMissMatch_Mean_in(int N, int numNodes0,int numNodes1, double* V,int numShapes0, int numShapes1) { 31 int l0=MIN(numShapes0,numNodes0-numShapes0); 32 int l1=MIN(numShapes1,numNodes1-numShapes1); 33 int i,k0,k1; 34 if (MAX(l0,l1)>0) { 35 if (numNodes1==numShapes1) { 36 for (k0=0;k00) { 61 if (numNodes1==numShapes1) { 62 for (k0=0;k00) { 98 if (numNodes1==numShapes1) { 99 for (k0=0;k00) { 126 if (numNodes1==numShapes1) { 127 for (k0=0;k0

## Properties

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