// test_Big_inverse.java tough matrix to invert accurately import java.math.BigDecimal; public class test_Big_inverse { final nbits = 332; // bits, 100 digits public test_Big_inverse() { int n; BigDecimal err; double time_start, now; System.out.println("test_Big_inverse.java on tough matrix to invert"); n = 1; while(n < 256) { time_start = System.CurrentTimeMillis(); n=n*2; System.out.println("initializing big matrix, n="+n+", n*n="+(n*n)); BigDecimal AA[][] = new BigDecimal[n][n]; BigDecimal AI[][] = new BigDecimal[n][n]; BigDecimal II[][] = new BigDecimal[n][n]; BigDecimal one = new BigDecimal(1.0); BigDecimal zero = new BigDecimal(0.0); one = one.setScale(nbits, BigDecimal.ROUND_DOWN); zero = zero.setScale(nbits, BigDecimal.ROUND_DOWN); for(int i=0; i