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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* This file contains routines for manipulating block matrices with blocks
* stored in LAPACK's packed storage scheme.
*/
#include <stdlib.h>
#include <stdio.h>
#include <csdp/declarations.h>
void store_packed(
struct blockmatrix A,
struct blockmatrix B)
{
int blk,i,j,n;
double *p;
double *q;
for (blk=1; blk<=A.nblocks; blk++)
{
switch (A.blocks[blk].blockcategory)
{
case DIAG:
p=A.blocks[blk].data.vec;
q=B.blocks[blk].data.vec;
n=A.blocks[blk].blocksize;
for (i=1; i<=n; i++)
q[i]=p[i];
break;
case MATRIX:
p=A.blocks[blk].data.mat;
q=B.blocks[blk].data.mat;
n=A.blocks[blk].blocksize;
#pragma omp parallel for schedule(dynamic,64) private(i,j) shared(p,q,n)
for (j=1; j<=n; j++)
for (i=1; i<=j; i++)
q[ijtokp(i,j,n)]=p[ijtok(i,j,n)];
break;
default:
printf("store_packed illegal block type \n");
exit(206);
};
}
}
void store_unpacked(
struct blockmatrix A,
struct blockmatrix B)
{
int blk,i,j,n;
double *p;
double *q;
for (blk=1; blk<=A.nblocks; blk++)
{
switch (A.blocks[blk].blockcategory)
{
case DIAG:
p=A.blocks[blk].data.vec;
q=B.blocks[blk].data.vec;
n=A.blocks[blk].blocksize;
for (i=1; i<=n; i++)
q[i]=p[i];
break;
case PACKEDMATRIX:
p=A.blocks[blk].data.mat;
q=B.blocks[blk].data.mat;
n=A.blocks[blk].blocksize;
#pragma omp parallel for schedule(dynamic,64) private(i,j) shared(p,q,n)
for (j=1; j<=n; j++)
for (i=1; i<=j; i++)
q[ijtok(i,j,n)]=p[ijtokp(i,j,n)];
for (j=1; j<n; j++)
for (i=j+1; i<=n; i++)
q[ijtok(i,j,n)]=q[ijtok(j,i,n)];
break;
default:
printf("store_unpacked block type \n");
exit(206);
};
}
}
/*
* Allocate space for a block matrix. Get strucutre info from A, and
* allocate the matrix B with matching structure.
*/
void alloc_mat_packed(
struct blockmatrix A,
struct blockmatrix *pB)
{
int blk,n;
/*
* First put up the number of blocks.
*/
pB->nblocks=A.nblocks;
/*
* Then allocate space for the block records.
*/
pB->blocks=(struct blockrec *)malloc(sizeof(struct blockrec)*(A.nblocks+1));
if (pB->blocks == NULL)
{
printf("Storage allocation failed!\n");
exit(205);
};
/*
* Now, fill in the info for each block.
*/
for (blk=1; blk <=A.nblocks; blk++)
{
switch (A.blocks[blk].blockcategory)
{
case DIAG:
pB->blocks[blk].blockcategory=A.blocks[blk].blockcategory;
pB->blocks[blk].blocksize=A.blocks[blk].blocksize;
pB->blocks[blk].data.vec=(double *)malloc(sizeof(double)*(A.blocks[blk].blocksize+1));
if (pB->blocks[blk].data.vec == NULL)
{
printf("Storage allocation failed!\n");
exit(205);
};
break;
case MATRIX:
n=A.blocks[blk].blocksize;
pB->blocks[blk].blockcategory=PACKEDMATRIX;
pB->blocks[blk].blocksize=n;
pB->blocks[blk].data.mat=(double *)malloc(sizeof(double)*n*(n+1)/2);
if (pB->blocks[blk].data.mat == NULL)
{
printf("Storage allocation failed!\n");
exit(205);
};
break;
default:
printf("Illegal block type!\n");
exit(206);
};
};
}
void free_mat_packed(
struct blockmatrix A)
{
int blk;
/*
* First, free the space for each block.
*/
for (blk=1; blk <=A.nblocks; blk++)
{
switch (A.blocks[blk].blockcategory)
{
case DIAG:
free(A.blocks[blk].data.vec);
break;
case PACKEDMATRIX:
free(A.blocks[blk].data.mat);
break;
default:
printf("Illegal block type!\n");
exit(206);
};
};
/*
* Then free space for the block records.
*/
free(A.blocks);
}
void triu(
struct blockmatrix A)
{
int i,j,n;
int blk;
for (blk=1; blk <= A.nblocks; blk++)
{
switch (A.blocks[blk].blockcategory)
{
case DIAG:
break;
case MATRIX:
n=A.blocks[blk].blocksize;
#pragma omp parallel for schedule(dynamic,64) private(i,j) shared(A,n)
for (j=1; j<n; j++)
for (i=j+1; i<=n; i++)
A.blocks[blk].data.mat[ijtok(i,j,n)]=0.0;
break;
default:
printf("triu illegal block type!\n");
exit(206);
};
};
}
|
