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
|
/*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include "itkFEMLinearSystemWrapperItpack.h"
#include <iostream>
/* Testing for linear system wrappers */
int itkFEMLinearSystemWrapperItpackTest2(int argc, char *argv[])
{
/* loop vars for printing */
unsigned int i;
unsigned int j;
/* declare wrapper */
itk::fem::LinearSystemWrapperItpack it;
/* system parameters */
unsigned int N = 3;
unsigned int nMatrices = 1;
unsigned int nVectors = 1;
unsigned int nSolutions = 1;
/* Set up the system */
it.SetSystemOrder(N);
it.SetNumberOfMatrices(nMatrices);
it.SetNumberOfVectors(nVectors);
it.SetNumberOfSolutions(nSolutions);
/* Set max non zeros in any matrix */
it.SetMaximumNonZeroValuesInMatrix(9);
/* Initialize memory */
for( i = 0; i < nMatrices; i++ )
{
it.InitializeMatrix(i);
}
for( i = 0; i < nVectors; i++ )
{
it.InitializeVector(i);
}
for( i = 0; i < nSolutions; i++ )
{
it.InitializeSolution(i);
}
/* matrix 0
* |11 0 0|
* | 0 22 0|
* | 0 0 33|
*/
it.SetMatrixValue(0, 0, 11, 0);
it.SetMatrixValue(1, 1, 22, 0);
it.SetMatrixValue(2, 2, 33, 0);
/* print matrix 0 */
std::cout << "Matrix 0" << std::endl;
for( i = 0; i < N; i++ )
{
for( j = 0; j < N; j++ )
{
std::cout << it.GetMatrixValue(i, j, 0) << " ";
}
std::cout << std::endl;
}
std::cout << std::endl;
/* Vector 0 = [1 2 3 ] */
it.SetVectorValue(0, 1, 0);
it.SetVectorValue(1, 2, 0);
it.SetVectorValue(2, 3, 0);
/* print Vector 0 */
std::cout << "Vector 0" << std::endl;
for( i = 0; i < N; i++ )
{
std::cout << it.GetVectorValue(i, 0) << " ";
}
std::cout << std::endl << std::endl;
if( argc > 1 )
{
int method = atoi(argv[1]);
switch( method )
{
case 0:
it.JacobianConjugateGradient();
break;
case 1:
it.JacobianSemiIterative();
break;
case 2:
it.SuccessiveOverrelaxation();
break;
case 3:
it.SymmetricSuccessiveOverrelaxationConjugateGradient();
break;
case 4:
it.SymmetricSuccessiveOverrelaxationSuccessiveOverrelaxation();
break;
case 5:
it.ReducedSystemConjugateGradient();
break;
case 6:
it.ReducedSystemSemiIteration();
break;
}
}
/* solve system */
std::cout << "Solve for x in: Matrix 0 * x = Vector 0" << std::endl;
it.Solve();
std::cout << "Solution 0" << std::endl;
for( i = 0; i < N; i++ )
{
std::cout << it.GetSolutionValue(i, 0) << " ";
}
std::cout << std::endl << std::endl;
/* destroy matrix,vector,solution */
it.DestroyMatrix(0);
it.DestroyVector(0);
it.DestroySolution(0);
std::cout << "Done." << std::endl;
return EXIT_SUCCESS;
}
|
