
jInvert_Demo: reading jInvert-Input.txt
 jInvert-Input.txt: for use in jInvert-Demo.exe                                 
      3, : Nin
     -1, : iRankIn   ignored.
  1,  1, ( +0.100000000000000000000000000000E+00, +0.000000000000000000000000000000E+00),
  1,  2, ( +0.100000000000000000000000000000E+00, +0.100000000000000000000000000000E+01),
  1,  3, ( +0.100000000000000000000000000000E+01, +0.000000000000000000000000000000E+00),
  2,  1, ( +0.200000000000000000000000000000E+01, +0.000000000000000000000000000000E+00),
  2,  2, ( +0.100000000000000000000000000000E+00, +0.000000000000000000000000000000E+00),
  2,  3, ( +0.100000000000000000000000000000E+00, -0.200000000000000000000000000000E+01),
  3,  1, ( +0.100000000000000000000000000000E+00, +0.000000000000000000000000000000E+00),
  3,  2, ( -0.400000000000000000000000000000E+01, +0.000000000000000000000000000000E+00),
  3,  3, ( +0.100000000000000000000000000000E+00, +0.000000000000000000000000000000E+00),

 {jInvert(Nin,C,iRankOut,iRW,iP):------ [allocating] --------- jInvert.f95 @ 97
  Writing binary file jCin.bim                                             @129
  Fortran arrays store in column-major order.

@ Rank =  0                     abs(CdetN) =       0.0000000000E+00
                           +1                             +2                             +3                         
           1  (    +0.100000,    +0.000000j) (    +0.100000,    +1.000000j) (    +1.000000,    +0.000000j)
           2  (    +2.000000,    +0.000000j) (    +0.100000,    +0.000000j) (    +0.100000,    -2.000000j)
           3  (    +0.100000,    +0.000000j) (    -4.000000,    +0.000000j) (    +0.100000,    +0.000000j)
             --------------------------------------------------------------------------------------------- 
                                   ValMin  =   0.400000E-23 scaled by pivot:

    iu =  3  ju =   2                Pivot = (    -4.000000,    +0.000000j)
@ Rank =  1                     abs(CdetN) =       0.4000000000E+01
                           +1                             +3                             -2                         
           1  (    +0.102500,    +0.025000j) (    +1.002500,    +0.025000j) (    +0.025000,    +0.250000j)
          -3  (    -0.025000,    +0.000000j) (    -0.025000,    +0.000000j) (    -0.250000,    +0.000000j)
           2  (    +2.002500,    +0.000000j) (    +0.102500,    -2.000000j) (    +0.025000,    +0.000000j)
             --------------------------------------------------------------------------------------------- 
    iu =  3  ju =   2                Pivot = (    +0.102500,    -2.000000j)
@ Rank =  2                     abs(CdetN) =       0.8010499360E+01
                           +1                             -3                             -2                         
           1  (    +0.076158,    -0.977403j) (    -0.013155,    -0.500576j) (    +0.024671,    +0.237486j)
          -3  (    -0.023721,    +0.024966j) (    +0.000639,    +0.012467j) (    -0.249984,    +0.000312j)
          -2  (    +0.051180,    +0.998627j) (    +0.025558,    +0.498690j) (    +0.000639,    +0.012467j)
             --------------------------------------------------------------------------------------------- 
    iu =  1  ju =   1                Pivot = (    +0.076158,    -0.977403j)
@ Rank =  3                     abs(CdetN) =       0.7853218703E+01
                           -1                             -3                             -2                         
          -1  (    +0.079239,    +1.016945j) (    +0.508016,    -0.053043j) (    -0.239555,    +0.043907j)
          -3  (    +0.027268,    +0.022144j) (    +0.011365,    -0.001474j) (    -0.254570,    +0.007334j)
          -2  (    +1.011493,    -0.131177j) (    -0.053412,    -0.005913j) (    +0.056746,    +0.249446j)
             --------------------------------------------------------------------------------------------- 
             sign untracked:         CdetN = (    +7.788000,    +1.010000j)

Cinv*Cin: maps inputs back into inputs. An Identity matrix if full-rank.
 (  +0.1000E+01,  -0.5778E-33j), (  -0.1189E-31,  +0.0000E+00j), (  -0.3852E-33,  +0.3948E-31j),
 (  +0.3852E-33,  +0.3370E-33j), (  +0.1000E+01,  +0.1926E-33j), (  +0.1156E-32,  +0.5778E-33j),
 (  +0.7704E-33,  +0.2119E-32j), (  +0.1541E-32,  +0.9244E-32j), (  +0.1000E+01,  -0.6741E-32j),

Cin*Cinv: maps outputs back into outputs. An Identity matrix if full-rank.
 (  +0.1000E+01,  -0.3081E-32j), (  -0.1926E-32,  +0.1059E-32j), (  +0.1926E-32,  +0.6933E-32j),
 (  -0.1156E-32,  +0.2465E-31j), (  +0.1000E+01,  -0.3081E-32j), (  -0.6163E-32,  +0.1541E-32j),
 (  +0.5778E-33,  +0.1156E-32j), (  -0.9630E-33,  -0.6139E-33j), (  +0.1000E+01,  +0.1926E-33j),

  Writing binary file jCinv.bim                                            @214
  Fortran arrays store in column-major order.
  jInvert} ---------------------------- [deallocated] --------------- Exit @230

jCinverse:
 jInvert-Input.txt: for use in jInvert-Demo.exe                                 
      3, : Nin
      3, : iRankOut
  1,  1, ( +0.792391567375853865750488981864E-01, +0.101694510165575741648166417730E+01),
  1,  2, ( +0.508015787253828431105168086077E+00, -0.530426226407764144088623224111E-01),
  1,  3, ( -0.239554901814154008678410619719E+00, +0.439073511597708716955822709189E-01),
  2,  1, ( +0.272683151491598176992852825620E-01, +0.221441964174818418237958223693E-01),
  2,  2, ( +0.113650949351551384426557573516E-01, -0.147390162872453644415540766887E-02),
  2,  3, ( -0.254570213852262586552400429594E+00, +0.733383615700888705931233100802E-02),
  3,  1, ( +0.101149344922880732139636240429E+01, -0.131177244956483743529831282529E+00),
  3,  2, ( -0.534119898476228933989377920117E-01, -0.591344250820504335735398434363E-02),
  3,  3, ( +0.567463477236505465823934359394E-01, +0.249446095120584610676910969402E+00),
  Program jInvert_Demo}                 [deallocated]                 Done @113

