Thu Sep 13 14:53:08 2018 QR_SOLVE_TESTS Python version: 3.6.5 Test the QR_SOLVE library. LSTSQ_SOLVE_TEST Python version: 3.6.5 NUMPY LINALG's LSTSQ function x=np.linalg.lstsq(A,b) solves a linear system A*x = b in the least squares sense. Compare a tabulated solution X1 to the LSTSQ result X2. Number of problems = 6 Index M N ||B|| ||X1 - X2|| ||X1|| ||X2|| ||R1|| ||R2|| 1 5 3 6.205 2.861e-08 5.461 5.461 1.075 1.075 2 6 3 537.6 5.416e-05 194.8 194.8 5.222 5.222 3 5 3 40.37 5.092e-08 10.84 10.84 5.477e-07 2.247e-14 4 3 5 232.1 1.074e-14 7.416 7.416 0 9.162e-14 5 10 10 1 1237 1.534e+07 1.534e+07 1.164e-10 5.074e-10 6 10 10 1 6.674e-16 1 1 4.983e-16 6.519e-16 LSTSQ_SOLVE_TEST Normal end of execution. NORMAL_SOLVE_TEST Python version: 3.6.5 NORMAL_SOLVE is a function with a simple interface which solves a linear system A*x = b in the least squares sense. Compare a tabulated solution X1 to the NORMAL_SOLVE result X2. NORMAL_SOLVE cannot be applied when N < M, or if the matrix does not have full column rank. Number of problems = 6 Index M N ||B|| ||X1 - X2|| ||X1|| ||X2|| ||R1|| ||R2|| 1 5 3 6.205 2.861e-08 5.461 5.461 1.075 1.075 2 6 3 537.6 5.416e-05 194.8 194.8 5.222 5.222 3 5 3 40.37 ------------ 10.84 ------------ 5.477e-07 ------------ 4 3 5 232.1 ------------ 7.416 ------------ 0 ------------ 5 10 10 1 ------------ 1.534e+07 ------------ 1.164e-10 ------------ 6 10 10 1 5.231e-16 1 1 4.983e-16 2.7e-16 NORMAL_SOLVE_TEST Normal end of execution. QR_SOLVE_TEST Python version: 3.6.5 QR_SOLVE is a function with a simple interface which solves a linear system A*x = b in the least squares sense. Compare a tabulated solution X1 to the QR_SOLVE result X2. Number of problems = 6 Index M N ||B|| ||X1 - X2|| ||X1|| ||X2|| ||R1|| ||R2|| 1 5 3 6.205 2.861e-08 5.461 5.461 1.075 1.075 2 6 3 537.6 5.416e-05 194.8 194.8 5.222 5.222 3 5 3 40.37 20.96 10.84 23.6 5.477e-07 7.105e-15 4 3 5 232.1 10.37 7.416 12.75 0 3.553e-14 5 10 10 1 2290 1.534e+07 1.534e+07 1.164e-10 7.766e-10 6 10 10 1 5.93e-16 1 1 4.983e-16 3.898e-16 QR_SOLVE_TEST Normal end of execution. SVD_SOLVE_TEST Python version: 3.6.5 SVD_SOLVE is a function with a simple interface which solves a linear system A*x = b in the least squares sense using the singular value decomposition (SVD). Compare a tabulated solution X1 to the QR_SOLVE result X2. Number of problems = 6 Index M N ||B|| ||X1 - X2|| ||X1|| ||X2|| ||R1|| ||R2|| 1 5 3 6.205 2.861e-08 5.461 5.461 1.075 1.075 2 6 3 537.6 5.416e-05 194.8 194.8 5.222 5.222 3 5 3 40.37 5.092e-08 10.84 10.84 5.477e-07 1.713e-14 4 3 5 232.1 1.027e-13 7.416 7.416 0 2.689e-13 5 10 10 1 1997 1.534e+07 1.534e+07 1.164e-10 5.673e-10 6 10 10 1 8.22e-16 1 1 4.983e-16 6.302e-16 SVD_SOLVE_TEST Normal end of execution. QR_SOLVE_TESTS Normal end of execution. Thu Sep 13 14:53:09 2018