test_psimeq_dbg.java fit data to 3 degree polynomial solve starting at 0.0010 psimeq_dbg solve inout data, n=4, m=5 A[0][0]=20.0 A[0][1]=18.999999999999996 A[0][2]=24.699999999999996 A[0][3]=36.1 Y[0]=89.99999999999996 A[1][0]=18.999999999999996 A[1][1]=24.699999999999996 A[1][2]=36.1 A[1][3]=56.2666 Y[1]=76.30199999999999 A[2][0]=24.699999999999996 A[2][1]=36.1 A[2][2]=56.2666 A[2][3]=91.333 Y[2]=91.7046 A[3][0]=36.1 A[3][1]=56.2666 A[3][2]=91.333 A[3][3]=152.45580999999999 Y[3]=126.5949 thread 0 start=0, <1 thread 0 start=1, <2 thread 0 start=2, <3 thread 3 start=3, <4 0 thread constructed at 0.011 0 B[0][0]=20.0 0 B[0][1]=18.999999999999996 0 B[0][2]=24.699999999999996 0 B[0][3]=36.1 0 B[0][4]=89.99999999999996 0 built working data structure 0<1 1 thread constructed at 0.012 1 B[1][0]=18.999999999999996 1 B[1][1]=24.699999999999996 1 B[1][2]=36.1 1 B[1][3]=56.2666 1 B[1][4]=76.30199999999999 1 built working data structure 1<2 2 thread constructed at 0.012 2 B[2][0]=24.699999999999996 2 B[2][1]=36.1 2 B[2][2]=56.2666 2 B[2][3]=91.333 2 B[2][4]=91.7046 2 built working data structure 2<3 3 thread constructed at 0.013 3 B[3][0]=36.1 3 B[3][1]=56.2666 3 B[3][2]=91.333 3 B[3][3]=152.45580999999999 3 B[3][4]=126.5949 3 built working data structure 3<4 new MyThread's constructed master starting to run threads 0 starting at 0.011 0 at st barrier.await() 1 starting at 0.012 1 at st barrier.await() 2 starting at 0.012 2 at st barrier.await() master waiting for first barrier, st 3 starting at 0.013 3 at st barrier.await() at master p1 barrier.await(), k_col=0 3 passed st barrier 3 spivot=3, smax=36.1 3 at p1 pivot barrier.await() 0 passed st barrier 0 spivot=0, smax=20.0 0 at p1 pivot barrier.await() 1 passed st barrier 1 spivot=1, smax=18.999999999999996 1 at p1 pivot barrier.await() 2 passed st barrier 2 spivot=2, smax=24.699999999999996 2 at p1 pivot barrier.await() master passed p1, k_col=0 in update_row for k_col=0 update_row I_pivot=3, abs_pivot=36.1 update prow[0]=3 pivrow B[3][1]=1.5586315789473684 pivrow B[3][2]=2.53 pivrow B[3][3]=4.223152631578947 pivrow B[3][4]=3.506783933518005 update reduced about pivot k_row=3 3 row divided 0.02 master at p2 barrier.await(), k_col=0 2 passed p1 pivot barrier 2 reduce B[2][1]=-2.3981999999999886 2 reduce B[2][2]=-6.224399999999989 2 reduce B[2][3]=-12.978869999999972 2 reduce B[2][4]=5.087036842105292 2 finished reduction for k_col=0 2 at p2 reduce barrier.await() 3 passed p1 pivot barrier 3 finished reduction for k_col=0 3 at p2 reduce barrier.await() 0 passed p1 pivot barrier 0 reduce B[0][1]=-12.172631578947371 0 reduce B[0][2]=-25.9 0 reduce B[0][3]=-48.363052631578945 0 reduce B[0][4]=19.86432132963985 0 finished reduction for k_col=0 0 at p2 reduce barrier.await() 1 passed p1 pivot barrier 1 reduce B[1][1]=-4.913999999999998 1 reduce B[1][2]=-11.969999999999985 1 reduce B[1][3]=-23.97329999999998 1 reduce B[1][4]=9.673105263157908 1 finished reduction for k_col=0 1 at p2 reduce barrier.await() master passed p2, k_col=0 looping to next k_col at master p1 barrier.await(), k_col=1 1 looping to find max for pivot 1 spivot=1, smax=4.913999999999998 1 at p1 pivot barrier.await() 2 looping to find max for pivot 2 spivot=2, smax=2.3981999999999886 2 at p1 pivot barrier.await() 3 looping to find max for pivot 3 spivot=3, smax=0.0 3 at p1 pivot barrier.await() 0 looping to find max for pivot 0 spivot=0, smax=12.172631578947371 0 at p1 pivot barrier.await() master passed p1, k_col=1 in update_row for k_col=1 update_row I_pivot=0, abs_pivot=12.172631578947371 update prow[1]=0 pivrow B[0][2]=2.1277239709443094 pivrow B[0][3]=3.973097544102386 pivrow B[0][4]=-1.6318838864716234 update reduced about pivot k_row=0 0 row divided 0.046 master at p2 barrier.await(), k_col=1 0 passed p1 pivot barrier 0 finished reduction for k_col=1 0 at p2 reduce barrier.await() 2 passed p1 pivot barrier 1 passed p1 pivot barrier 3 passed p1 pivot barrier 1 reduce B[1][2]=-1.5143644067796522 2 reduce B[2][2]=-1.1216923728813697 1 reduce B[1][3]=-4.449498668280864 3 reduce B[3][2]=-0.7863377723970939 1 reduce B[1][4]=1.654027845036353 2 reduce B[2][3]=-3.4505874697336765 1 finished reduction for k_col=1 3 reduce B[3][3]=-1.9694426668972662 1 at p2 reduce barrier.await() 2 reduce B[2][4]=1.173452905569063 2 finished reduction for k_col=1 2 at p2 reduce barrier.await() 3 reduce B[3][4]=6.05028969214804 3 finished reduction for k_col=1 3 at p2 reduce barrier.await() master passed p2, k_col=1 looping to next k_col at master p1 barrier.await(), k_col=2 3 looping to find max for pivot 3 spivot=3, smax=0.0 3 at p1 pivot barrier.await() 1 looping to find max for pivot 2 looping to find max for pivot 2 spivot=2, smax=1.1216923728813697 2 at p1 pivot barrier.await() 0 looping to find max for pivot 1 spivot=1, smax=1.5143644067796522 0 spivot=0, smax=0.0 1 at p1 pivot barrier.await() 0 at p1 pivot barrier.await() master passed p1, k_col=2 in update_row for k_col=2 update_row I_pivot=1, abs_pivot=1.5143644067796522 update prow[2]=1 pivrow B[1][3]=2.9381954887218162 pivrow B[1][4]=-1.0922257797604342 update reduced about pivot k_row=1 1 row divided 0.071 master at p2 barrier.await(), k_col=2 0 passed p1 pivot barrier 0 reduce B[0][3]=-2.278571428571453 0 reduce B[0][4]=0.6920710868079922 0 finished reduction for k_col=2 0 at p2 reduce barrier.await() 3 passed p1 pivot barrier 3 reduce B[3][3]=0.3409714285714376 3 reduce B[3][4]=5.191431305536541 3 finished reduction for k_col=2 3 at p2 reduce barrier.await() 2 passed p1 pivot barrier 2 reduce B[2][3]=-0.15483599999996667 2 reduce B[2][4]=-0.051688421052622724 2 finished reduction for k_col=2 1 passed p1 pivot barrier 2 at p2 reduce barrier.await() 1 finished reduction for k_col=2 1 at p2 reduce barrier.await() master passed p2, k_col=2 looping to next k_col at master p1 barrier.await(), k_col=3 1 looping to find max for pivot 1 spivot=1, smax=0.0 1 at p1 pivot barrier.await() 0 looping to find max for pivot 0 spivot=0, smax=0.0 0 at p1 pivot barrier.await() 3 looping to find max for pivot 3 spivot=3, smax=0.0 3 at p1 pivot barrier.await() 2 looping to find max for pivot 2 spivot=2, smax=0.15483599999996667 2 at p1 pivot barrier.await() master passed p1, k_col=3 in update_row for k_col=3 update_row I_pivot=2, abs_pivot=0.15483599999996667 update prow[3]=2 pivrow B[2][4]=0.3338268946022492 update reduced about pivot k_row=2 2 row divided 0.096 master waiting for join 1 passed p1 pivot barrier 3 passed p1 pivot barrier 3 reduce B[3][4]=5.077605872388445 3 finished reduction for k_col=3 3 at p2 reduce barrier.await() 3 thread ends at 0.107 0 passed p1 pivot barrier 0 reduce B[0][4]=1.4527195109374111 0 finished reduction for k_col=3 0 at p2 reduce barrier.await() 0 thread ends at 0.108 2 passed p1 pivot barrier 1 reduce B[1][4]=-2.073074455494776 2 finished reduction for k_col=3 1 finished reduction for k_col=3 2 at p2 reduce barrier.await() 1 at p2 reduce barrier.await() 2 thread ends at 0.108 1 thread ends at 0.108 master build X for return prow[0]=3 prow[1]=0 prow[2]=1 prow[3]=2 solve constructor end, took 0.109 C[0]=5.077605872388445 C[1]=1.4527195109374111 C[2]=-2.073074455494776 C[3]=0.3338268946022492 max_err=8.812102588487045, avg_err=1.4105421903981077, rms_err=2.456053630658106 fit data to 4 degree polynomial solve starting at 0.0 psimeq_dbg solve inout data, n=5, m=6 A[0][0]=20.0 A[0][1]=18.999999999999996 A[0][2]=24.699999999999996 A[0][3]=36.1 A[0][4]=56.2666 Y[0]=89.99999999999996 A[1][0]=18.999999999999996 A[1][1]=24.699999999999996 A[1][2]=36.1 A[1][3]=56.2666 A[1][4]=91.333 Y[1]=76.30199999999999 A[2][0]=24.699999999999996 A[2][1]=36.1 A[2][2]=56.2666 A[2][3]=91.333 A[2][4]=152.45580999999999 Y[2]=91.7046 A[3][0]=36.1 A[3][1]=56.2666 A[3][2]=91.333 A[3][3]=152.45580999999999 A[3][4]=259.72867 Y[3]=126.5949 A[4][0]=56.2666 A[4][1]=91.333 A[4][2]=152.45580999999999 A[4][3]=259.72867 A[4][4]=449.40730666 Y[4]=187.05379319999997 thread 0 start=0, <1 thread 0 start=1, <2 thread 0 start=2, <3 thread 3 start=3, <5 0 thread constructed at 0.0050 0 B[0][0]=20.0 0 B[0][1]=18.999999999999996 0 B[0][2]=24.699999999999996 0 B[0][3]=36.1 0 B[0][4]=56.2666 0 B[0][5]=89.99999999999996 0 built working data structure 0<1 1 thread constructed at 0.0060 1 B[1][0]=18.999999999999996 1 B[1][1]=24.699999999999996 1 B[1][2]=36.1 1 B[1][3]=56.2666 1 B[1][4]=91.333 1 B[1][5]=76.30199999999999 1 built working data structure 1<2 2 thread constructed at 0.0060 2 B[2][0]=24.699999999999996 2 B[2][1]=36.1 2 B[2][2]=56.2666 2 B[2][3]=91.333 2 B[2][4]=152.45580999999999 2 B[2][5]=91.7046 2 built working data structure 2<3 3 thread constructed at 0.0070 3 B[3][0]=36.1 3 B[3][1]=56.2666 3 B[3][2]=91.333 3 B[3][3]=152.45580999999999 3 B[3][4]=259.72867 3 B[3][5]=126.5949 3 B[4][0]=56.2666 3 B[4][1]=91.333 3 B[4][2]=152.45580999999999 3 B[4][3]=259.72867 3 B[4][4]=449.40730666 3 B[4][5]=187.05379319999997 3 built working data structure 3<5 new MyThread's constructed master starting to run threads 0 starting at 0.0050 0 at st barrier.await() 1 starting at 0.0060 1 at st barrier.await() 2 starting at 0.0060 2 at st barrier.await() master waiting for first barrier, st 3 starting at 0.0070 3 at st barrier.await() at master p1 barrier.await(), k_col=0 3 passed st barrier 3 spivot=4, smax=56.2666 3 at p1 pivot barrier.await() 0 passed st barrier 0 spivot=0, smax=20.0 0 at p1 pivot barrier.await() 1 passed st barrier 1 spivot=1, smax=18.999999999999996 1 at p1 pivot barrier.await() 2 passed st barrier 2 spivot=2, smax=24.699999999999996 2 at p1 pivot barrier.await() master passed p1, k_col=0 in update_row for k_col=0 update_row I_pivot=4, abs_pivot=56.2666 update prow[0]=4 pivrow B[4][1]=1.6232187478895117 pivrow B[4][2]=2.7095258999122036 pivrow B[4][3]=4.616036334166274 pivrow B[4][4]=7.98710614574188 pivrow B[4][5]=3.324419694810065 update reduced about pivot k_row=4 4 row divided 0.021 master at p2 barrier.await(), k_col=0 1 passed p1 pivot barrier 1 reduce B[1][1]=-6.141156209900721 1 reduce B[1][2]=-15.380992098331859 1 reduce B[1][3]=-31.438090349159182 1 reduce B[1][4]=-60.42201676909568 1 reduce B[1][5]=13.138025798608773 1 finished reduction for k_col=0 1 at p2 reduce barrier.await() 0 passed p1 pivot barrier 0 reduce B[0][1]=-13.464374957790238 0 reduce B[0][2]=-29.49051799824408 0 reduce B[0][3]=-56.22072668332547 0 reduce B[0][4]=-103.47552291483758 0 reduce B[0][5]=23.511606103798655 0 finished reduction for k_col=0 0 at p2 reduce barrier.await() 3 passed p1 pivot barrier 3 reduce B[3][1]=-2.3315967988113755 3 reduce B[3][2]=-6.48088498683056 3 reduce B[3][3]=-14.18310166340251 3 reduce B[3][4]=-28.605861861281824 3 reduce B[3][5]=6.583349017356653 3 finished reduction for k_col=0 3 at p2 reduce barrier.await() 2 passed p1 pivot barrier 2 reduce B[2][1]=-3.9935030728709293 2 reduce B[2][2]=-10.658689727831415 2 reduce B[2][3]=-22.68309745390694 2 reduce B[2][4]=-44.825711799824404 2 reduce B[2][5]=9.59143353819141 2 finished reduction for k_col=0 2 at p2 reduce barrier.await() master passed p2, k_col=0 looping to next k_col at master p1 barrier.await(), k_col=1 2 looping to find max for pivot 2 spivot=2, smax=3.9935030728709293 2 at p1 pivot barrier.await() 1 looping to find max for pivot 1 spivot=1, smax=6.141156209900721 1 at p1 pivot barrier.await() 0 looping to find max for pivot 0 spivot=0, smax=13.464374957790238 0 at p1 pivot barrier.await() 3 looping to find max for pivot 3 spivot=3, smax=2.3315967988113755 3 at p1 pivot barrier.await() master passed p1, k_col=1 in update_row for k_col=1 update_row I_pivot=0, abs_pivot=13.464374957790238 update prow[1]=0 pivrow B[0][2]=2.1902626813865886 pivrow B[0][3]=4.175517011340895 pivrow B[0][4]=7.685133787437238 pivrow B[0][5]=-1.7462085078219896 update reduced about pivot k_row=0 0 row divided 0.048 master at p2 barrier.await(), k_col=1 3 passed p1 pivot barrier 3 reduce B[3][2]=-1.3740755303535703 3 reduce B[3][3]=-4.447479566377639 3 reduce B[3][4]=-10.687228524056017 3 reduce B[3][5]=2.5118948504617133 3 reduce B[4][2]=-0.8457495473172592 3 reduce B[4][3]=-2.1617411607738495 3 reduce B[4][4]=-4.487547098065374 3 reduce B[4][5]=6.158898082430888 3 finished reduction for k_col=1 3 at p2 reduce barrier.await() 2 passed p1 pivot barrier 2 reduce B[2][2]=-1.9118689793195518 2 reduce B[2][3]=-6.008157438292237 2 reduce B[2][4]=-14.135106404269592 2 reduce B[2][5]=2.617944496330934 2 finished reduction for k_col=1 2 at p2 reduce barrier.await() 1 passed p1 pivot barrier 1 reduce B[1][2]=-1.9302468312208045 1 reduce B[1][3]=-5.795588125416948 1 reduce B[1][4]=-13.226409686457636 1 reduce B[1][5]=2.4142865770162896 1 finished reduction for k_col=1 1 at p2 reduce barrier.await() 0 passed p1 pivot barrier 0 finished reduction for k_col=1 0 at p2 reduce barrier.await() master passed p2, k_col=1 looping to next k_col at master p1 barrier.await(), k_col=2 0 looping to find max for pivot 0 spivot=0, smax=0.0 0 at p1 pivot barrier.await() 3 looping to find max for pivot 3 spivot=3, smax=1.3740755303535703 3 at p1 pivot barrier.await() 2 looping to find max for pivot 2 spivot=2, smax=1.9118689793195518 2 at p1 pivot barrier.await() 1 looping to find max for pivot 1 spivot=1, smax=1.9302468312208045 1 at p1 pivot barrier.await() master passed p1, k_col=2 in update_row for k_col=2 update_row I_pivot=1, abs_pivot=1.9302468312208045 update prow[2]=1 pivrow B[1][3]=3.0025114051095056 pivrow B[1][4]=6.852185675182514 pivrow B[1][5]=-1.2507657248629436 update reduced about pivot k_row=1 1 row divided 0.073 master at p2 barrier.await(), k_col=2 1 passed p1 pivot barrier 1 finished reduction for k_col=2 1 at p2 reduce barrier.await() 0 passed p1 pivot barrier 0 reduce B[0][3]=-2.4007716697080648 0 reduce B[0][4]=-7.322952782846787 0 reduce B[0][5]=0.9932969825027613 0 finished reduction for k_col=2 0 at p2 reduce barrier.await() 3 passed p1 pivot barrier 3 reduce B[3][3]=-0.32180211500915146 3 reduce B[3][4]=-1.2718078583484669 3 reduce B[3][5]=0.7932482737225963 3 reduce B[4][3]=0.3776315009124227 3 reduce B[4][4]=1.3076858348540448 3 reduce B[4][5]=5.10106353682811 3 finished reduction for k_col=2 3 at p2 reduce barrier.await() 2 passed p1 pivot barrier 2 reduce B[2][3]=-0.2677490228102126 2 reduce B[2][4]=-1.0346251713503456 2 reduce B[2][5]=0.2266443065693391 2 finished reduction for k_col=2 2 at p2 reduce barrier.await() master passed p2, k_col=2 looping to next k_col at master p1 barrier.await(), k_col=3 2 looping to find max for pivot 2 spivot=2, smax=0.2677490228102126 2 at p1 pivot barrier.await() 1 looping to find max for pivot 1 spivot=1, smax=0.0 1 at p1 pivot barrier.await() 0 looping to find max for pivot 0 spivot=0, smax=0.0 0 at p1 pivot barrier.await() 3 looping to find max for pivot 3 spivot=3, smax=0.32180211500915146 3 at p1 pivot barrier.await() master passed p1, k_col=3 in update_row for k_col=3 update_row I_pivot=3, abs_pivot=0.32180211500915146 update prow[3]=3 pivrow B[3][4]=3.9521426337185477 pivrow B[3][5]=-2.4650188321479423 update reduced about pivot k_row=3 3 row divided 0.098 master at p2 barrier.await(), k_col=3 3 passed p1 pivot barrier 3 reduce B[4][4]=-0.18476771973706563 3 reduce B[4][5]=6.031932298189525 3 finished reduction for k_col=3 3 at p2 reduce barrier.await() 2 passed p1 pivot barrier 2 reduce B[2][4]=0.023557156834375537 2 reduce B[2][5]=-0.433362076947044 2 finished reduction for k_col=3 2 at p2 reduce barrier.await() 1 passed p1 pivot barrier 1 reduce B[1][4]=-5.014167657176945 1 reduce B[1][5]=6.150481432470968 1 finished reduction for k_col=3 1 at p2 reduce barrier.await() 0 passed p1 pivot barrier 0 reduce B[0][4]=2.1652392868301185 0 reduce B[0][5]=-4.9246503950148774 0 finished reduction for k_col=3 0 at p2 reduce barrier.await() master passed p2, k_col=3 looping to next k_col at master p1 barrier.await(), k_col=4 0 looping to find max for pivot 0 spivot=0, smax=0.0 0 at p1 pivot barrier.await() 3 looping to find max for pivot 3 spivot=3, smax=0.0 3 at p1 pivot barrier.await() 2 looping to find max for pivot 2 spivot=2, smax=0.023557156834375537 2 at p1 pivot barrier.await() 1 looping to find max for pivot 1 spivot=1, smax=0.0 1 at p1 pivot barrier.await() master passed p1, k_col=4 in update_row for k_col=4 update_row I_pivot=2, abs_pivot=0.023557156834375537 update prow[4]=2 pivrow B[2][5]=-18.39619611118201 update reduced about pivot k_row=2 2 row divided 0.123 master waiting for join 1 passed p1 pivot barrier 1 reduce B[1][5]=-86.09113012330216 1 finished reduction for k_col=4 1 at p2 reduce barrier.await() 1 thread ends at 0.134 0 passed p1 pivot barrier 0 reduce B[0][5]=34.90751615314786 0 finished reduction for k_col=4 0 at p2 reduce barrier.await() 0 thread ends at 0.134 3 passed p1 pivot barrier 3 reduce B[3][5]=70.23937211710182 3 reduce B[4][5]=2.6329090908905504 3 finished reduction for k_col=4 3 at p2 reduce barrier.await() 3 thread ends at 0.135 2 passed p1 pivot barrier 2 finished reduction for k_col=4 2 at p2 reduce barrier.await() 2 thread ends at 0.135 master build X for return prow[0]=4 prow[1]=0 prow[2]=1 prow[3]=3 prow[4]=2 solve constructor end, took 0.135 C[0]=2.6329090908905504 C[1]=34.90751615314786 C[2]=-86.09113012330216 C[3]=70.23937211710182 C[4]=-18.39619611118201 max_err=7.396751820253041, avg_err=1.317833167320169, rms_err=2.052239625730393