1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
|
// Jacobi iteration on a mesh. Based loosely on a Filaments demo |
10 |
|
|
11 |
|
public class FJJacobi { |
12 |
|
|
13 |
< |
static final int DEFAULT_GRANULARITY = 4096; // 1024; |
13 |
> |
// static final int DEFAULT_GRANULARITY = 4096; |
14 |
> |
static final int DEFAULT_GRANULARITY = 256; |
15 |
|
|
16 |
|
/** |
17 |
|
* The maximum number of matrix cells |
77 |
|
} |
78 |
|
} |
79 |
|
|
79 |
– |
|
80 |
|
abstract static class MatrixTree extends RecursiveAction { |
81 |
|
// maximum difference between old and new values |
82 |
|
double maxDiff; |
92 |
|
reinitialize(); |
93 |
|
} |
94 |
|
double m = maxDiff; |
95 |
< |
return (md > m)? md : m; |
95 |
> |
return (md > m) ? md : m; |
96 |
|
} |
97 |
|
|
98 |
|
} |
99 |
|
|
100 |
– |
|
100 |
|
static final class LeafNode extends MatrixTree { |
101 |
|
final double[][] A; // matrix to get old values from |
102 |
|
final double[][] B; // matrix to put new values into |
117 |
|
|
118 |
|
public void compute() { |
119 |
|
boolean AtoB = (steps++ & 1) == 0; |
120 |
< |
double[][] a = (AtoB)? A : B; |
121 |
< |
double[][] b = (AtoB)? B : A; |
120 |
> |
double[][] a = AtoB ? A : B; |
121 |
> |
double[][] b = AtoB ? B : A; |
122 |
|
|
123 |
|
double md = 0.0; // local for computing max diff |
124 |
|
|
160 |
|
} |
161 |
|
} |
162 |
|
|
164 |
– |
|
163 |
|
static final class TwoNode extends MatrixTree { |
164 |
|
final MatrixTree q1; |
165 |
|
final MatrixTree q2; |
175 |
|
|
176 |
|
} |
177 |
|
|
180 |
– |
|
178 |
|
static final class Driver extends RecursiveAction { |
179 |
|
MatrixTree mat; |
180 |
|
double[][] A; double[][] B; |
246 |
|
System.out.println("max diff after " + steps + " steps = " + md); |
247 |
|
} |
248 |
|
} |
252 |
– |
|
253 |
– |
|
249 |
|
} |