testing QRDecomposition.java
A matrix of A * X = Y
0.500  0.333  0.250  0.200   
0.333  0.250  0.200  0.167   
0.250  0.200  0.167  0.143   
0.200  0.167  0.143  0.125   
 
Expected solution Xt = 
1.000  2.000  3.000  4.000   
 
right hand side Y = 
2.717  2.100  1.721  1.462   
 
running QRDecomp
sing=false  A =
 2.3617799  -0.4895554  -0.3846507  -0.3176282   
 0.6666667   0.1184937  -0.0522176  -0.0539782   
 0.5000000   0.0515811   0.0045427  -0.0031026   
 0.4000000   0.0545982   0.0034012   0.0000471   
 
C =
3.216224325498811
0.009841171863294914
1.610232209738321E-5
0.0
 
D =
-0.6808899405271832
-0.04152612607176588
-0.0017723261532862978
4.7135508347256015E-5
 
R =
-0.6808899  -0.4895554  -0.3846507  -0.3176282   
 0.0000000  -0.0415261  -0.0522176  -0.0539782   
 0.0000000   0.0000000  -0.0017723  -0.0031026   
 0.0000000   0.0000000   0.0000000   0.0000471   
 
Q = not really computed
 2.3617799   0.0000000   0.0000000   0.0000000   
 0.6666667   0.1184937   0.0000000   0.0000000   
 0.5000000   0.0515811   0.0045427   0.0000000   
 0.4000000   0.0545982   0.0034012   0.0000471   
 
check A =  Q * R , yet bad Q
average error = 0.6885940997496848
 
running QRSolve
running RSolve
0.9999999999998176  error = -1.8240964294591322E-13
2.0000000000013656  error = 1.3655743202889425E-12
2.9999999999973106  error = -2.6894042548519792E-12
4.000000000001545  error = 1.545430450278218E-12
test QRDecomposition.java finished