
  For symplectic scaling, the complexity of the used algorithms is
  hard to estimate and depends upon how well the rows and columns of
  A in (1) are equilibrated.  In one sweep, each row/column of A is
  scaled once, i.e., the cost of one sweep is N**2 multiplications.
  Usually, 3-6 sweeps are enough to equilibrate the norms of the
  rows and columns of a matrix.  Roundoff errors are possible as
  LAPACK routine DGEBAL does NOT use powers of the machine base for
  scaling. The second stage (equilibratin