docs: public void setToInverseL( double a[] ) {
  
          // the more direct method which takes full advantage of the sparsity of the data structures proved to
          // be difficult to get right due to the conjugates and reordering.
          // See comparable real number code for an example.
          for (int col = 0; col < n; col++) {
              Arrays.fill(vv,0);
              vv[col*2] = 1;
              TriangularSolver_ZDRM.solveL_diagReal(t, vv, n);
              TriangularSolver_ZDRM.solveConjTranL_diagReal(t, vv, n);
              for( int i = 0; i < n; i++ ) {
                  a[(i*numCols+col)*2  ] = vv[i*2];
                  a[(i*numCols+col)*2+1] = vv[i*2+1];
              }
          }
          // NOTE: If you want to make inverse faster take advantage of the sparsity
      }