References

[1]  J. J. Dongarra, J. R. Bunch, C. B. Moler and G. W.  Stewart,
     LINPACK  Users'  Guide,  Society  for Industrial and Applied
     Mathematics, Philadelphia, 1979.

[2]  B. T. Smith, J. M. Boyle, J. J. Dongarra, B. S.  Garbow,  Y.
     Ikebe, V. C. Klema, C. B. Moler, Matrix Eigensystem Routines
     -- EISPACK Guide, Lecture Notes in Computer Science,  volume
     6, second edition, Springer-Verlag, 1976.

[3]  B. S. Garbow, J. M. Boyle, J.  J.  Dongarra,  C.  B.  Moler,
     Matrix  Eigensystem  Routines  --  EISPACK  Guide Extension,
     Lecture Notes in  Computer  Science,  volume  51,  Springer-
     Verlag, 1977.

[4]  S. Cohen and  S.  Piper,  SPEAKEASY  III  Reference  Manual,
     Speakeasy Computing Corp., Chicago, Ill., 1979.

[5]  J. H. Wilkinson  and  C.  Reinsch,  Handbook  for  Automatic
     Computation,  volume  II,  Linear  Algebra, Springer-Verlag,
     1971.

[6]  Niklaus Wirth, Algorithms  +  Data  Structures  =  Programs,
     Prentice-Hall, 1976.

[7]  H. B. Keller and D. Sachs, "Calculations of the Conductivity
     of  a  Medium Containing Cylindrical Inclusions", J. Applied
     Physics 35, 537-538, 1964.

[8]  C. B. Moler and C. F. Van Loan,  Nineteen  Dubious  Ways  to
     Compute  the  Exponential  of a Matrix, SIAM Review 20, 801-
     836, 1979.

[9]  G. E. Forsythe, M. A. Malcolm  and  C.  B.  Moler,  Computer
     Methods for Mathematical Computations, Prentice-Hall, 1977.

[10] C. B. Moler and D. R. Morrison, "Replacing square  roots  by
     Pythagorean   sums",  University  of  New  Mexico,  Computer
     Science  Department,   technical   report,   submitted   for
     publication, 1980.