COLLEGE OF ENGINEERING BIOGRAPHICAL DATA

UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN

Department: Computer Science

Date: November 2011

1. Name: Heath, Michael Thomas
Citizenship: United States

2. Present Academic Rank: Professor 3. Tenure Status: AA

4. Administrative Titles: Director, Computational Science and Engineering, 1996-present
Director, Center for Simulation of Advanced Rockets, 1997-present
Interim Head, Department of Computer Science, 2007-2009

5. Degrees
B.A. Mathematics University of Kentucky 1968
M.S. Mathematics University of Tennessee 1974
Ph.D. Computer Science Stanford University 1978

6. Academic Positions Held

7. Other Professional Employment 8. Honors, Recognition and Outstanding Achievements

a. Teaching

b. Research

FACTUAL INFORMATION

A. Resident Instruction and Continuing Education

1. Resident Instruction.

SemesterCourseUnitsPer WeekStudentsInstructionResponsibility
Fall 91CS 3503.03.021lect/disc100
Fall 92CS 3503.03.048lect/disc100
Fall 93CS 3503.03.083lect/disc100
Fall 94CS 3503.03.067lect/disc100
Spr 95CS 4911.21.24lect/disc100
Fall 95CS 3503.03.090lect/disc100
Fall 95CS 4911.21.29lect/disc100
Spr 96CS 4911.21.28lect/disc100
Fall 96CS 4911.21.26lect/disc100
Spr 97CS 4543.03.027lect/disc100
Spr 97CS 4911.21.210lect/disc100
Fall 97CS 3503.03.081lect/disc100
Fall 97CS 4911.21.2 5lect/disc100
Spr 98CS 4911.21.211lect/disc100
Fall 98CS 3503.03.081lect/disc100
Fall 98CS 4911.21.213lect/disc100
Spr 99CS 4911.21.26lect/disc100
Spr 99CS 4971.51.57lect/disc100
Fall 99CS 4543.03.043lect/disc100
Fall 99CS 4911.21.215lect/disc100
Spr 00CS 4911.21.217lect/disc100
Fall 00CS 3503.03.0106lect/disc100
Fall 00CS 4911.21.212lect/disc100
Spr 01CS 4911.21.215lect/disc100
Fall 01CS 3503.03.098lect/disc100
Fall 01CS 4911.21.218lect/disc100
Spr 02CS 4543.03.029lect/disc100
Spr 02CS 4911.21.214lect/disc100
Fall 02CS 3503.03.0104lect/disc100
Fall 02CS 4911.21.210lect/disc100
Spr 03CS 1991.21.28lect/disc100
Spr 03CS 4911.21.27lect/disc100
Fall 03CS 1991.21.24lect/disc100
Fall 03CS 3503.03.0113lect/disc100
Fall 03CS 4911.21.28lect/disc100
Spr 04CS 4543.03.030lect/disc100
Spr 04CS 4911.21.26lect/disc100
Fall 04CS 4503.03.097lect/disc100
Fall 04CS 5911.21.28lect/disc100
Spr 05CS 5911.21.29lect/disc100
Fall 05CS 5911.21.26lect/disc100
Spr 06CS 5543.03.019lect/disc100
Spr 06CS 5911.21.25lect/disc100
Fall 06CS 5911.21.23lect/disc100
Spr 07CS 4503.03.086lect/disc100
Spr 07CS 5911.21.24lect/disc100
Fall 07CS 4583.03.014lect/disc100
Fall 07CS 5911.21.25lect/disc100
Spr 08CS 5543.03.010lect/disc100
Spr 08CS 5911.21.21lect/disc100

2. Continuing Education.

None

3. Other Instructional Activities.

4. Undergraduate Advising, Current Year Only

Currently academic advisor for 23 undergraduate students.

B. Research, Creative, and Other Scholarly Activities

1. Publications

a1. Books Authored or Co-Authored, Original Editions

  1. Heath, M. T., Scientific Computing: An Introductory Survey, McGraw-Hill, New York, 1997.

a1. Books Authored or Co-Authored, Revisions

  1. Heath, M. T., Scientific Computing: An Introductory Survey, Second Edition, McGraw-Hill, New York, 2002.
b1. Books Edited or Co-Edited
  1. Heath, M. T., editor, Hypercube Multiprocessors 1986, SIAM, Philadelphia, PA, 1986.
  2. Heath, M. T., editor, Hypercube Multiprocessors 1987, SIAM, Philadelphia, PA, 1987.
  3. Heath, M. T., V. Torczon, et al., editors, Proc. Eighth SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1997.
  4. Henderson, B., K. A. Yelick, et al., editors, Proc. Ninth SIAM Conf. on Parallel Processing for Scientific Computing, SIAM, Philadelphia, PA, 1999.
  5. Heath, M. T., A. Ranade, and R. S. Schreiber, editors, Algorithms for Parallel Processing, Springer-Verlag, New York, 1999.
  6. Heath, M. T., and A. Lumsdaine, editors, Proc. Eighth ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, ACM Press, New York, 2001.
c. Chapters in Books
  1. George, A., and M. T. Heath, “Solution of Sparse Linear Least Squares Problems Using Givens Rotations,” in Large Scale Matrix Problems, ed. by A. Bjorck, R. J. Plemmons and H. Schneider, Elsevier North Holland, 1981, pp. 69-83.
  2. Geist, G. A., M. T. Heath, and E. Ng, “Parallel Algorithms for Matrix Computations,” in The Characteristics of Parallel Algorithms, ed. by R. Douglass, D. Gannon, and L. Jamieson, MIT Press, Cambridge, 1987, pp. 233-251.
  3. Heath, M. T., “Parallel Computing: Perspectives and Prospects,” in Opportunities and Constraints of Parallel Computing, ed. by J. L. C. Sanz, Springer-Verlag, New York, 1989, pp. 63-66.
  4. George, A., M. T. Heath, J. Liu, and E. Ng, “Solution of Sparse Positive Definite Systems on a Hypercube,” in Parallel Algorithms for Numerical Linear Algebra, ed. by H. A. Van der Vorst and P. Van Dooren, North Holland, Amsterdam, 1990, pp. 129-156.
  5. Heath, M. T., E. Ng, and B. W. Peyton, “Parallel Algorithms for Sparse Linear Systems,” in Parallel Algorithms for Matrix Computations, SIAM, Philadelphia, PA, 1990, pp. 83-124.
  6. Heath, M. T., “Visualization of Parallel and Distributed Systems,” in Parallel and Distributed Computing Handbook, ed. by A. Y. Zomaya, McGraw-Hill, New York, 1996, pp. 897-916.
  7. Heath, M. T., “Parallel Direct Methods for Sparse Linear Systems,” in Parallel Numerical Algorithms, ed. by D. E. Keyes, A. Sameh, and V. Venkatakrishnan, Kluwer Academic Publishers, Boston, 1997, pp. 55-90.
  8. Heath, M. T., A. D. Malony, and D. T. Rover, “Visualization for Parallel Performance Evaluation and Optimization,” in Software Visualization: Programming as a Multimedia Experience, ed. by J. Stasko, J. Domingue, M. H. Brown, and B. A. Price, MIT Press, Cambridge, MA, 1998, pp. 347-365.
  9. Heath, M. T., and P. Raghavan, “Performance of Parallel Sparse Triangular Solution,” in Algorithms for Parallel Processing, ed. by M. T. Heath, A. Ranade, and R. S. Schreiber, Springer-Verlag, New York, 1999, pp. 289-305.
  10. Heath, M. T., and X. Jiao, “Parallel Methods and Software for Multicomponent Simulations,” in Parallel Processing for Scientific Computing, ed. by M. A. Heroux, P. Raghavan and H. D. Simon, SIAM, Philadelphia, PA, 2006, pp. 341-355.
  11. Golub, G. H., M. T. Heath, and G. Wahba, “Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter,” in Milestones in Matrix Computation, ed. by R. H. Chan, C. Greif, and D. P. O'Leary, Oxford University Press, New York, 2007, pp. 202-212.
d. Monographs
  1. Gallivan, K. A., M. T. Heath, E. Ng, J. M. Ortega, B. W. Peyton, R. J. Plemmons, C. H. Romine, A. H. Sameh, and R. G. Voigt, Parallel Algorithms for Matrix Computations, SIAM, Philadelphia, PA, 1990.
e1. Articles in Journals
  1. Haaland, C. M., and M. T. Heath, “Mapping of Population Density,” Demography, Vol. 11, No. 2 (May 1974), pp. 321-336.
  2. Golub, G. H., M. T. Heath, and G. Wahba, “Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter,” Technometrics, Vol. 21, No. 2 (May 1979), pp. 215-223.
  3. Chan, T. F., W. M. Coughran, E. H. Grosse, and M. T. Heath, “A Numerical Library and Its Support,” ACM Trans. Math. Software, Vol. 6, No. 2 (June 1980), pp. 135-145.
  4. George, A., and M. T. Heath, “Solution of Sparse Linear Least Squares Problems Using Givens Rotations,” Linear Algebra Appl., Vol. 34 (December 1980), pp. 69-83.
  5. George, A., M. T. Heath, and R. J. Plemmons, “Solution of Large-Scale Sparse Least Squares Problems Using Auxiliary Storage,” SIAM J. Sci. Stat. Comput., Vol. 2, No. 4 (December 1981), pp. 416-429.
  6. Heath, M. T., “Some Extensions of an Algorithm for Sparse Linear Least Squares Problems,” SIAM J. Sci. Stat. Comput., Vol. 3, No. 2 (June 1982), pp. 223-237.
  7. George, A., M. T. Heath, and E. Ng, “A Comparison of Some Methods for Solving Sparse Linear Least Squares Problems,” SIAM J. Sci. Stat. Comput., Vol. 4, No. 2 (June 1983), pp. 177-187.
  8. Heath, M. T., “Numerical Methods for Large Sparse Linear Least Squares Problems,” SIAM J. Sci. Stat. Comput., Vol. 5, No. 3 (September 1984), pp. 497-513.
  9. Heath, M. T., R. J. Plemmons, and R. C. Ward, “Sparse Orthogonal Schemes for Structural Optimization Using the Force Method,” SIAM J. Sci. Stat. Comput., Vol. 5, No. 3 (September 1984), pp. 514-532.
  10. George, A., M. T. Heath, and E. Ng, “Solution of Sparse Underdetermined Systems of Linear Equations,” SIAM J. Sci. Stat. Comput., Vol. 5, No. 4 (December 1984), pp. 988-997.
  11. Grossman, G., and M. T. Heath, “Simultaneous Heat and Mass Transfer in Absorption of Gases in Turbulent Liquid Films,” Internat. J. Heat Mass Transfer, Vol. 27, No. 12 (December 1984), pp. 2365-2376.
  12. Berry, M. W., M. T. Heath, I. Kaneko, M. Lawo, R. J. Plemmons, and R. C. Ward, “An Algorithm to Compute a Sparse Basis of the Null Space,” Numer. Math., Vol. 47, No. 4 (December 1985), pp. 483-504.
  13. George, A., M. T. Heath, and J. Liu, “Parallel Cholesky Factorization on a Shared-Memory Multiprocessor,” Linear Algebra Appl., Vol. 77 (May 1986), pp. 165-187.
  14. Heath, M. T., and D. C. Sorensen, “A Pipelined Givens Method for Computing the QR Factorization of a Sparse Matrix,” Linear Algebra Appl., Vol. 77 (May 1986), pp. 189-203.
  15. Scott, D. S., M. T. Heath, and R. C. Ward, “Parallel Block Jacobi Eigenvalue Algorithms Using Systolic Arrays,” Linear Algebra Appl., Vol. 77 (May 1986), pp. 345-355.
  16. George, A., M. T. Heath, J. Liu, and E. Ng, “Solution of Sparse Positive Definite Systems on a Shared-Memory Multiprocessor,” Internat. J. Parallel Programming, Vol. 15, No. 4 (August 1986), pp. 309-325.
  17. Heath, M. T., A. J. Laub, C. C. Paige, and R. C. Ward, “Computing the Singular Value Decomposition of a Product of Two Matrices,” SIAM J. Sci. Stat. Comput., Vol. 7, No. 4 (October 1986), pp. 1147-1159.
  18. Laub, A. J., M. T. Heath, C. C. Paige, and R. C. Ward, “Computation of System Balancing Transformations and Other Applications of Simultaneous Diagonalization Algorithms,” IEEE Trans. Automatic Control, Vol. AC-32, No. 2 (February 1987), pp. 115-122.
  19. Gilbert, J. R., and M. T. Heath, “Computing a Sparse Basis for the Null Space,” SIAM J. Alg. Disc. Meth., Vol. 8, No. 3 (July 1987), pp. 446-459.
  20. George, A., M. T. Heath, J. Liu, and E. Ng, “Symbolic Cholesky Factorization on a Local-Memory Multiprocessor,” Parallel Computing, Vol. 5, Nos. 1 & 2 (July 1987), pp. 85-95.
  21. George, A., M. T. Heath, J. Liu, and E. Ng, “Sparse Cholesky Factorization on a Local-Memory Multiprocessor,” SIAM J. Sci. Stat. Comput., Vol. 9, No. 2 (March 1988), pp. 327-340.
  22. Heath, M. T., and C. H. Romine, “Parallel Solution of Triangular Systems on Distributed-Memory Multiprocessors,” SIAM J. Sci. Stat. Comput., Vol. 9, No. 3 (May 1988), pp. 558-588.
  23. Eisenstat, S. C., M. T. Heath, C. S. Henkel, and C. H. Romine, “Modified Cyclic Algorithms for Solving Triangular Systems on Distributed-Memory Multiprocessors,” SIAM J. Sci. Stat. Comput., Vol. 9, No. 3 (May 1988), pp. 589-600.
  24. George, A., M. T. Heath, J. Liu, and E. Ng, “Solution of Sparse Positive Definite Systems on a Hypercube,” J. Comp. Appl. Math., Vol. 27, Nos. 1 & 2 (September 1989), pp. 129-156.
  25. Heath, M. T., G. A. Geist, and J. B. Drake, “Early Experience with the Intel iPSC/860 at Oak Ridge National Laboratory,” Internat. J. Supercomput. Appl., Vol. 5, No. 2 (Summer 1991), pp. 10-26.
  26. Heath, M. T., E. Ng, and B. W. Peyton, “Parallel Algorithms for Sparse Linear Systems,” SIAM Review, Vol. 33, No. 3 (September 1991), pp. 420-460.
  27. Heath, M. T., and J. A. Etheridge, “Visualizing the Performance of Parallel Programs,” IEEE Software, Vol. 8, No. 5 (September 1991), pp. 29-39.
  28. Demmel, J. W., M. T. Heath, and H. A. van der Vorst, “Parallel Numerical Linear Algebra,” Acta Numerica, Vol. 2, (1993), pp. 111-197.
  29. Karp, A. H., M. Heath, D. Heller, and H. Simon, “1994 Gordon Bell Prize Winners,” IEEE Computer, Vol. 28, No. 1 (January 1995), pp. 68-74.
  30. Heath, M. T., and P. Raghavan, “A Cartesian Parallel Nested Dissection Algorithm,” SIAM J. Matrix Anal. Appl., Vol. 16, No. 1 (January 1995), pp. 235-253.
  31. Heath, M. T., A. D. Malony, and D. T. Rover, “The Visual Display of Parallel Performance Data,” IEEE Computer, Vol. 28, No. 11 (November 1995), pp. 21-28.
  32. Heath, M. T., A. D. Malony, and D. T. Rover, “Parallel Performance Visualization: From Practice to Theory,” IEEE Parallel Distrib. Tech., Vol. 3, No. 4 (Winter 1995), pp. 44-60.
  33. Karp, A. H., M. Heath, and A. Geist, “1995 Gordon Bell Prize Winners,” IEEE Computer, Vol. 29, No. 1 (January 1996), pp. 79-85.
  34. Heath, M. T., and P. Raghavan, “Performance of a Fully Parallel Sparse Solver,” Internat. J. Supercomput. Appl. High Perf. Comput., Vol. 11, No. 1, (Spring 1997), pp. 49-64.
  35. Nasir, M. A., W. C. Chew, P. Raghavan, and M. T. Heath, “A Comparison of Computational Complexities of HFEM and ABC Based Finite Element Methods,” J. Electromagnetic Waves Appl., Vol. 11, (1997), pp. 1601-1617.
  36. Heath, M. T. and W. A. Dick, “Virtual Rocketry: Rocket Science Meets Computer Science,” IEEE Comput. Sci. Engr., Vol. 5, No. 1 (January-March 1998), pp. 16-26.
  37. Heath, M. T. and W. A. Dick, “Virtual Prototyping of Solid Propellant Rockets” Comput. Sci. Engr., Vol. 2, No. 2 (March-April 2000), pp. 21-32.
  38. Jiao, X., and M. T. Heath, “Overlaying Surface Meshes, Part I: Algorithms,” Internat. J. Comput. Geom. Appl., Vol. 14, No. 6, (December 2004), pp. 379-402.
  39. Jiao, X., and M. T. Heath, “Overlaying Surface Meshes, Part II: Topology Preservation and Feature Matching,” Internat. J. Comput. Geom. Appl., Vol. 14, No. 6, (December 2004), pp. 403-419.
  40. Jiao, X., and M. T. Heath, “Common-Refinement-Based Data Transfer between Non-matching Meshes in Multiphysics Simulations,” Internat. J. Numer. Meth. Engrg., Vol. 61, No. 14 (December 2004), pp. 2402-2427.
  41. Lopez, V., P. Boyland, M. T. Heath, and R. D. Moser, “Relative Periodic Solutions of the Complex Ginzburg-Landau Equation,” SIAM J. Appl. Dynamical Systems, Vol. 4, No. 4 (2005), pp. 1042-1075.
  42. Sahinidis, N. V., M. T. Harandi, M. T. Heath, L. Murphy, M. Snir, R. P. Wheeler, and C. F. Zukoski, “Establishing a Master's Degree Programme in Bioinformatics: Challenges and Opportunities,” IEE Proc. Syst. Biol., Vol. 152, No. 4 (December 2005), pp. 269-275.
  43. Jiao, X., G. Zheng, P. A. Alexander, M. T. Campbell, O. S. Lawlor, J. Norris, A. Haselbacher, and M. T. Heath, “A System Integration Framework for Coupled Multiphysics Simulations,” Engineering with Computers, Vol. 22, No. 3-4 (December 2006), pp. 293-309.
  44. Gates, M. R., K. Matous, and M. T. Heath, “Asynchronous Multi-Domain Variational Integrators for Non-Linear Problems,” Internat. J. Numer. Meth. Engrg., Vol. 76, (June 2008), pp. 1353-1378.
  45. Wolf, M. M., and M. T. Heath, “Combinatorial Optimization of Matrix-Vector Multiplication in Finite Element Assembly,” SIAM J. Sci. Comput., Vol. 31, No. 4 (July 2009), pp. 2960-2980.
  46. Avetisyan, A. I., R. Campbell, I. Gupta, M. T. Heath, et al., “Open Cirrus: A Global Cloud Computing Testbed,” IEEE Computer, Vol. 43, No. 4 (April 2010), pp. 35-43.
  47. Hewett, R. J., M. T. Heath, M. D. Butala, and F. Kamalabadi, “A Robust Null Space Method for Linear Equality Constrained State Estimation,” IEEE Trans. Signal Proc., Vol. 58, No. 8 (August 2010), pp. 3961-3971.
  48. Gates, M., J. Lambros, and M. T. Heath, “Towards High Performance Digital Volume Correlation,” Experimental Mechanics, Vol. 51, No. 4 (2011), pp. 491-507.
e2. Articles in Conference Proceedings
  1. George, A., G. H. Golub, M. T. Heath, and R. J. Plemmons, “Least Squares Adjustment of Large-Scale Geodetic Networks by Orthogonal Decomposition,” Proc. Symp. on Geodetic Networks and Computations, Munich, Germany, 1981.
  2. Berry, M. W., M. T. Heath, R. J. Plemmons, and R. C. Ward, “Orthogonal Schemes for Structural Optimization,” Trans. First Army Conf. Appl. Math. Comput., Army Research Office Rept. 84-1, February 1984, pp. 477-485.
  3. Heath, M. T., “Sparse Matrix Computations,” Proc. 23rd IEEE Conf. on Decision and Control, Las Vegas, Nevada, December 1984, pp. 662-665.
  4. Heath, M. T., “The Hypercube: A Tutorial Overview,” Hypercube Multiprocessors 1986, SIAM, Philadelphia, 1986, pp. 7-10.
  5. Geist, G. A., and M. T. Heath, “Matrix Factorization on a Hypercube Multiprocessor,” Hypercube Multiprocessors 1986, SIAM, Philadelphia, 1986, pp. 161-180.
  6. Heath, M. T., “Hypercube Applications at Oak Ridge National Laboratory,” Hypercube Multiprocessors 1987, SIAM, Philadelphia, 1987, pp. 395-417.
  7. Henkel, C. S., M. T. Heath, and R. J. Plemmons, “Cholesky Downdating on a Hypercube,” Proc. Third Conf. Hypercube Concurrent Comput. Appl., ACM, New York, 1988, pp. 1592-1598.
  8. George, A., M. T. Heath, J. Liu, and E. Ng, “Sparse Cholesky Factorization on a Local-Memory Multiprocessor,” Parallel Processing and Medium-Scale Multiprocessors, SIAM, Philadelphia, 1989, pp. 58-75.
  9. Geist, G. A., M. T. Heath, B. W. Peyton, and P. H. Worley, “A Machine-Independent Communication Library,” Proc. Fourth Conf. Hypercubes, Concurrent Comput. Appl., Golden Gate Enterprises, Los Altos, CA, 1990, pp. 565-568.
  10. Heath, M. T., “Visual Animation of Parallel Algorithms for Matrix Computations,” Proc. Fifth Distributed Memory Comput. Conf., IEEE Computer Soc. Press, Los Alamitos, CA, 1990, pp. 1213-1222.
  11. Worley, P. H., and M. T. Heath, “Performance Characterization Research at Oak Ridge National Laboratory,” Proc. Fourth SIAM Conf. Parallel Processing Sci. Comput., SIAM, Philadelphia, PA, 1990, pp. 431-436.
  12. Heath, M. T., “Mathematical Software,” System Software and Tools for High Performance Computing Environments, SIAM, Philadelphia, 1993, pp. 35-50.
  13. Heath, M. T., “Recent Developments and Case Studies in Performance Visualization Using ParaGraph,” Performance Measurement and Visualization of Parallel Systems, Elsevier Science Publishers, Amsterdam, 1993, pp. 175-200.
  14. Heath, M. T., and P. Raghavan, “Distributed Solution of Sparse Symmetric Positive Definite Systems,” Proc. Scalable Parallel Libraries Conf., IEEE Computer Soc. Press, Los Alamitos, CA, 1994, pp. 114-122.
  15. Heath, M. T., and P. Raghavan, “Performance of a Fully Parallel Sparse Solver,” Proc. Scalable High Performance Comput. Conf., IEEE Computer Soc. Press, Los Alamitos, CA, 1994, pp. 334-341.
  16. Heath, M. T., “Performance Visualization with ParaGraph,” Proc. Second Workshop on Environments and Tools for Parallel Sci. Comput., SIAM, Philadelphia, 1994, pp. 221-230.
  17. Nasir, M. A., W. C. Chew, P. Raghavan, and M. T. Heath, “O(1.5) Solution of Hybrid FEM Problems,” Proc. IEEE Antennas and Propagation Soc. Internat. Symp., 1994, Vol. 1, pp. 447-450.
  18. Jiao, X., H. Edelsbrunner, and M. T. Heath, “Mesh Association: Formulation and Algorithms,” 8th International Meshing Roundtable, Lake Tahoe, CA, October 1999.
  19. Pinar, A., and M. T. Heath, “Improving Performance of Sparse Matrix-Vector Multiplication,” Supercomputing 99, Portland, OR, November 1999.
  20. Heath, M. T, R. A. Fiedler, and W. A. Dick, “Simulating Solid Propellant Rockets at CSAR,” AIAA 2000-3455, 36th AIAA/ASME/SAE/ASEE Joint Propulsion Conf., Huntsville, AL, July 2000.
  21. Dick, W. A., R. A. Fiedler, and M. T. Heath, “Integrated Simulation of Solid Propellant Rockets,” Second European Conference on Launcher Technology, Centre National d'Etudes Spatiales, Rome, Italy, November 2000.
  22. Dick, W. A., M. T. Heath, and R. A. Fiedler, “Integrated 3-D Simulation of Solid Propellant Rockets,” AIAA 2001-3949, 37th AIAA/ASME/SAE/ASEE Joint Propulsion Conf., Salt Lake City, UT, July 2001.
  23. Jiao, X., and M. T. Heath, “Efficient and Robust Algorithm for Overlaying Surface Meshes,” Proc. 10th International Meshing Roundtable, Newport Beach, CA, October 2001.
  24. Jiao, X., and M. T. Heath, “Feature Detection for Surface Meshes,” Proc. 8th Internat. Conf. on Numerical Grid Generation in Computational Field Simulation, Honolulu, HI, June 2002.
  25. Dick, W. A., and M. T. Heath, “Whole System Simulation of Solid Propellant Rockets,” AIAA 2002-4345, 38th AIAA/ASME/SAE/ASEE Joint Propulsion Conf., Indianapolis, IN, July 2002.
  26. Lopez, V., P. Boyland, M. Heath, and R. Moser, “Relative Time-Periodic Solutions of the Complex Ginzburg-Landau Equation,” SIAM Conf. Appl. Dynamical Systems, Snowbird, UT, May 2003.
  27. Jiao, X., M. T. Campbell, and M. T. Heath, “Roccom: An Object-Oriented, Data Centric Software Integration Framework for Multiphysics Simulations,” 17th Ann. ACM Internat. Conf. Supercomputing, San Francisco, CA, June 2003.
  28. Jiao, X., and M. T. Heath, “Accurate, Conservative Data Transfer Between Nonmatching Meshes in Multiphysics Simulations,” 7th U.S. National Congress on Computational Mechanics, Albuquerque, NM, July 2003.
  29. Heath, M. T., and X. Jiao, “Parallel Computational Methods in Multicomponent Systems,” Proc. 11th SIAM Conf. Parallel Processing for Scientific Computing, San Francisco, CA, February 2004.
  30. Heath, M. T., and X. Jiao, “Parallel Simulation of Multicomponent Systems,” VECPAR 2004: 6th Internat. Conf. on High Performance Computing for Computational Science, Valencia, Spain, June 2004, pp. 496-513.
  31. Heath, M. T., and X. Jiao, “Academic Challenges in Coupling Large-Scale Multiphysics Simulations,” Internat. Conf. Computational Science, Atlanta, Georgia, May 2005.
  32. Dick, W. A., M. T. Heath, R. A. Fiedler, and M. D. Brandyberry, “Advanced Simulation of Solid Propellant Rockets from First Principles,” AIAA 2005-3990, 41st AIAA/ASME/SAE/ASEE Joint Propulsion Conf., Tucson, AZ, July 2005.
  33. Jiao, X., G. Zheng, O. S. Lawlor, P. J. Alexander, M. T. Campbell, M. T. Heath and R. A. Fiedler, “An Integration Framework for Simulations of Solid Rocket Motors,” AIAA 2005-3991, 41st AIAA/ASME/SAE/ASEE Joint Propulsion Conf., Tucson, AZ, July 2005.
  34. Dick, W. A., and M. T. Heath, “SP Rocket Simulations at CSAR,” ISTS 2006-a-28, Proc. 25th International Symposium on Space Technology and Science, Kanazawa, Japan, June 2006.
  35. Dick, W. A., R. A. Fiedler, and M. T. Heath, “High-fidelity Simulation of Solid Propellant Rockets,” ISTS 2006-a-27, Proc. 25th International Symposium on Space Technology and Science, Kanazawa, Japan, June 2006.
  36. Dick, W. A, and M. T. Heath, “Building Rocstar: Simulation Science for Solid Propellant Rocket Motors,” AIAA 2006-4590, 42nd AIAA/ASME/SAE/ASEE Joint Propulsion Conf., Sacramento, CA, July 2006.
f. Publications in above categories that have been submitted but not yet accepted
  1. Cochran, W. K., and M. T. Heath, “Generating Sufficient Pseudo-Random Numbers in Parallel Using an Approximate One-Way Hash Function,” J. Comput. Physics, submitted 2010.
  2. Jiang, P., J. Peng, M. T. Heath, and R. Yang, “Finding the Densest k-Subgraph via 1-Mean Clustering and Low-Dimension Approximation,” Math. Programming Comput., submitted 2011.
  3. Reichert, A., M. T. Heath, and D. J. Bodony, “Energy Stable Numerical Methods for Hyperbolic Partial Differential Equations Using Overlapping Domain Decomposition,” J. Comput. Physics, submitted 2011.

g. Other

Bulletins or Reports (selected list not duplicating items listed elsewhere)

  1. Funderlic, R. E., and M. T. Heath, “Linear Compartmental Analysis of Ecosystems,” Tech. Rept. ORNL-IBP-71-4, Oak Ridge National Laboratory, August 1971.
  2. Heath, M. T., “The Numerical Solution of Ill-Conditioned Systems of Linear Equations,” Tech. Rept. ORNL-4957, Oak Ridge National Laboratory, April 1974.
  3. Chan, T. F., M. T. Heath, W. M. Coughran, and F. T. Luk, “Numerical Analysis Program Library User's Guide,” User Note 82, Stanford Linear Accelerator Center Computing Services, Stanford Center for Information Processing, October 1975.
  4. Heath, M. T., “Numerical Algorithms for Nonlinearly Constrained Optimization,” Tech. Rept. STAN-CS-78-656, Dept. of Computer Science, Stanford University, April 1978.
  5. Heath, M. T., editor, “Sparse Matrix Software Catalog,” Oak Ridge National Laboratory, October 1982.
  6. Heath, M. T., “Parallel Cholesky Factorization in Message-Passing Multiprocessor Environments,” Tech. Rept. ORNL-6150, Oak Ridge National Laboratory, May 1985.
  7. Geist, G. A., and M. T. Heath, “Parallel Cholesky Factorization on a Hypercube Multiprocessor,” Tech. Rept. ORNL-6190, Oak Ridge National Laboratory, August 1985.
  8. Heath, M. T., “Parallel Computing at ORNL,” Oak Ridge National Laboratory Review, Vol. 18, No. 4 (1985), pp. 1-7.
  9. Heath, M. T., “Supercomputer Research and Development Requirements for Army Sponsored Independent Research Center,” white paper prepared for U.S. Army Research Office, 1987.
  10. Bailey, D., E. Brooks, J. Dongarra, A. Hayes, M. Heath, and G. Lyon, “Benchmarks to Supplant Export FPDR Calculations,” Tech. Rept. NBSIR 88-3795, Institute for Computer Sciences and Technology, National Bureau of Standards, Gaithersburg, MD, June 1988.
  11. Heath, M. T., and C. H. Romine, “A Consumer's Guide to Advanced Computer Architectures,” white paper prepared for U.S. Army Research Office, 1989.
  12. Geist, G. A., M. T. Heath, B. W. Peyton, and P. H. Worley, “PICL: A Portable Instrumented Communication Library, C Reference Manual,” ORNL/TM-11130, Oak Ridge National Laboratory, July 1990.
  13. Geist, G. A., M. T. Heath, B. W. Peyton, and P. H. Worley, “A Users' Guide to PICL: A Portable Instrumented Communication Library,” ORNL/TM-11616, Oak Ridge National Laboratory, September 1990.
  14. Ostrouchov, L. S., M. T. Heath, and C. H. Romine, “Modeling Speedup in Parallel Sparse Matrix Factorization,” ORNL/TM-11786, Oak Ridge National Laboratory, March 1991.
  15. Heath, M. T., and J. A. Etheridge, “Visualizing Performance of Parallel Programs,” ORNL/TM-11813, Oak Ridge National Laboratory, May 1991.
  16. Heath, M. T., and P. Raghavan, “Distributed Solution of Sparse Linear Systems,” UIUC-DCS-1793, Dept. of Computer Science, University of Illinois at Urbana-Champaign, February 1993.
  17. Sterling, T., P. Messina, M. T. Heath, et al., “System Software and Tools for High Performance Computing Environments,” Publication 93-15, Jet Propulsion Laboratory, Pasadena, California, April 1993.
  18. Hovland, P., and M. T. Heath, “Adaptive SOR: A Case Study in Automatic Differentiation of Algorithm Parameters,” Preprint ANL/MCS-P673-0797, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, July 1997.
  19. Heath, M. T., “Whole-System Simulation of Solid Rockets Is Goal of ASCI Center at Illinois,” SIAM News, Vol. 31, No. 4 (May 1998), pp. 1, 8.
Software

Professor Heath is principal developer or co-developer of the following software packages. They have been developed under funding from the U.S. Government and are freely distributed via the Internet.

2. Grants, Contracts and Gifts Received

a) For Research

YearsTitleAgencyPI/Co-PIAmount
1991-1998Scalable Parallel LibrariesDARPAPI$950,000
1997-2002 Center for Simulation of Advanced RocketsDOEPI$20,250,000
1998-2001Utilization of Advanced Intel-Based PlatformsIntelPI$3,900,000
1998-2001Simulation and Optimization of CastingNSF/Co-PI$2,100,000
and Extrusion ProcessesDARPA
1998-2001Integrated Computational Environment forNSFCo-PI$1,100,000
Studying Ion Movement in Biological Systems
2002-2010 Center for Simulation of Advanced RocketsDOEPI$26,250,000
2003-2006Robust Lagrangian Surface PropagationNSFCo-PI$400,000
with Topological Control
2006-2008Meshing CollaborationBoeingPI$126,477
2006-2008Massive Parallelization of xFDCaterpillarPI$190,000
2008-2010Cloud Computing TestbedNSF/Yahoo/IntelPI$560,000
2010-2012Towards Green Data CentersNSFCo-PI$293,893

b) For Instruction

YearsTitleAgencyPI/Co-PIAmount
2000-2002 Interactive Modules in Computational ScienceNSF/NCSAPI$60,000

3. Areas of Research

Professor Heath's general areas of research are in large-scale scientific computing, numerical analysis, and parallel computing. His primary research interests are in numerical linear algebra in general, and sparse matrix computations in particular. He also has significant research interests in parallel performance visualization, parallel programming environments, numerical optimization, and mathematical software.

4. Graduate Thesis Research Advising

M.S. Degrees Granted or Anticipated

(c.) Ph.D. Degrees Granted or Anticipated

5. Editorships of Journals or Other Learned Publications 6. Postdoctoral Associates and Visiting Scientists 7. Other Scholarly Activities

Conference Committee Memberships:

C. Service

1. Professional Society

2. University 3. Federal and State Improvement Activities