ANNA TSAO

Center for Computing Sciences, Institute for Defense Analyses, 17100 Science Drive, Bowie, MD 20721, tel: 301-805-7432, fax: 301-805-7604, email: anna@super.org

Education

1981 - Ph.D., mathematics, University of Michigan (Thesis area: complex analysis)

1974 - M.S., mathematics, Michigan State University

1972 - B.A., mathematics, Michigan State University

Postgraduate Work Experience

1998-present - Consultant to DARPA, Defense Sciences Office

1988-present - Research Staff Member, Center for Computing Sciences (formerly Supercomputing Research Center), Institute for Defense Analyses (IDA)

1994-1998 - Program Manager, Defense Advanced Research Projects Agency (DARPA), Defense Sciences Office

1986-1988 - Member of Technical Staff, Government Systems, AT&T Bell Labs

1984-1986 - Systems Engineer, Air-to-Ground Tactical Software Dept., Radar Systems Group, Hughes Aircraft Company

1983-1984 - Assistant Professor, Dept. of Mathematics, Texas Tech University

1981-1983 — Assistant Professor, Dept. of Mathematics, U. S. Naval Academy

1980-1981 — Instructor, Dept. of Mathematics, U. S. Naval Academy

Research Interests

- Scalable, architecture-aware numerical linear algebra algorithms
- Computer architecture design paradigms informed by algorithmic structure

Selected Publications

*Disproof of a coefficient conjecture for meromorphic univalent functions*, Trans. Amer. Math. Soc., **274**, (1982), 783-796.

(with J. E. Brown) *On the Zalcman conjecture for starlike and typically real functions*, Math. Zeitschrift, **191**, (1986), 467-474.

*Application of ASPEN for eigensolution beamforming*, AT&T Bell Laboratories Technical Memorandum, (1988).

(with L. Auslander) *On parallelizable eigensolvers*, Adv. Appl. Math., **13**, (1992), 253-261.

(with S. Huss-Lederman, E. M. Jacobson, & G. Zhang) *Matrix multiplication on the Intel Touchstone Delta*, Concurrency: Practice and Experience, **6**, (1994), 571-594.

(with C. H. Bischof, S. Huss-Lederman, & X. Sun) *The PRISM project: infrastructure and algorithms for parallel eigensolvers*, Proceedings, Scalable Parallel Libraries Conference (Starksville, MS, Oct. 6-8, 1993), IEEE, 1993, 123-131.

(with C. H. Bischof, S. Huss-Lederman, E. M. Jacobson, & X. Sun) *On the impact of HPF data layout on the design of efficient and maintainable parallel linear algebra libraries*, Argonne NationalLab. ANL/MCS-TM-184, 1993, (available from the archives of the HPF Forum).

(with C. H. Bischof, S. Huss-Lederman, X. Sun, & T. Turnbull) *Parallel performance of a symmetric eigensolver based on the invariant subspace decomposition approach*, Proceedings: Scalable High Performance Computing Conference '94, Knoxville, Tennessee, May 1994, IEEE Computer Society Press, 1994, 32-39.

(with C. Bischof, X. Sun, & T. Turnbull) *A study of the Invariant Subspace Decomposition Algorithm for banded symmetric matrices*, Proceedings: Fifth SIAM Conference on Applied Linear Algebra, Snowbird, UT, June, 1994, John G. Lewis, editor, SIAM, Philadelphia, 1994, 321-325.

(with C. Bischof, S. Huss-Lederman, X. Sun, & T. Turnbull) *Parallel studies of the Invariant Subspace Decomposition Approach for banded symmetric matrices*, Proceedings, Seventh SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, February 1995, 6 pages.

(with S. Huss-Lederman, E. M. Jacobson, J. R. Johnson, & T. Turnbull) *Implementation of Strassen's Algorithm for Matrix Multiplication*, Proceedings, Supercomputing '96, August 1996, 25 pages.

(with S. Huss-Lederman, E. M. Jacobson, J. R. Johnson, & T. Turnbull) *Strassen's Algorithm for Matrix Multiplication: Modeling, Analysis, and Implementation*, Center for Computing Sciences Technical Report, 1996, 67 pages.

(with S. Huss-Lederman & T. Turnbull) *A parallelizable eigensolver for real diagonalizable matrices with real eigenvalues*, SIAM J. Sci. Comput., **18**, 1997, 869-885.