blob: 203ec24bbbf562dc28335e6c47c49b5ff1fa61f3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
#include <stdio.h>
#include <stdlib.h>
#include <cross.h>
void dcrossa (double* inp1, int size1_r, int size1_c, double* inp2, int size2_r, int size2_c ,double* oup)
{
int i,j;
if (size1_c == 3 && size1_r == 1) // Calculating the cross product for a 1X3 Matrix
{
oup[0] = inp1[1]*inp2[2] - inp1[2]*inp2[1];
oup[1] = inp1[2]*inp2[0] - inp1[0]*inp2[2];
oup[2] = inp1[0]*inp2[1] - inp1[1]*inp2[0];
printf("%lf ", oup[0]);
printf("%lf ", oup[1]);
printf("%lf \n", oup[2]);
}
else // Calculating the cross product for a 3XN Matrix
{
for(i = 0; i < size1_r; i++)
{
for(j = 0; j < size1_c; j = j+3)
{
oup[j+(i*size1_r)] = inp1[(j+1)+(i*size1_r)] * inp2[(j+2)+(i*size1_r)] - inp1[(j+2)+(i*size1_r)] * inp2[(j+1)+(i*size1_r)];
oup[(j+1)+(i*size1_r)] = inp1[(j+2)+(i*size1_r)] * inp2[(j+0)+(i*size1_r)] - inp1[(j+0)+(i*size1_r)] * inp2[(j+2)+(i*size1_r)];
oup[(j+2)+(i*size1_r)] = inp1[(j+0)+(i*size1_r)] * inp2[(j+1)+(i*size1_r)] - inp1[(j+1)+(i*size1_r)] * inp2[(j+0)+(i*size1_r)];
}
}
}
}
|
