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 |
18 |
|
* at which to stop recursing down and instead directly update. |
19 |
< |
**/ |
19 |
< |
|
19 |
> |
*/ |
20 |
|
static final double EPSILON = 0.0001; // convergence criterion |
21 |
|
|
22 |
|
public static void main(String[] args) throws Exception { |
93 |
|
reinitialize(); |
94 |
|
} |
95 |
|
double m = maxDiff; |
96 |
< |
return (md > m)? md : m; |
96 |
> |
return (md > m) ? md : m; |
97 |
|
} |
98 |
|
|
99 |
|
} |
119 |
|
|
120 |
|
public void compute() { |
121 |
|
boolean AtoB = (steps++ & 1) == 0; |
122 |
< |
double[][] a = (AtoB)? A : B; |
123 |
< |
double[][] b = (AtoB)? B : A; |
122 |
> |
double[][] a = AtoB ? A : B; |
123 |
> |
double[][] b = AtoB ? B : A; |
124 |
|
|
125 |
|
double md = 0.0; // local for computing max diff |
126 |
|
|