David Watkins

Numerical Analysis $\bullet$ Scientific Computing

  1. QR-like algorithms for eigenvalue problems, J. Comp. Appl. Math., 123 (2000), 67-83.

  2. Performance of the QZ algorithm in the presence of infinite eigenvalues, SIAM J. Matrix Anal. Appl., 22 (2000), 364-375.

  3. Cholesky-like factorizations of skew-symmetric matrices, (with P. Benner, R. Byers, H. Fassbender and V. Mehrmann), Electron. Trans. Numer. Anal., 11 (2000), 85-93.

  4. Structure-preserving methods for computing eigenpairs of large, sparse skew-Hamiltonian Hamiltonian pencils, (with Volker Mehrmann), SIAM J. Sci. Comput., 22 (2001), 1905-1925.

  5. Polynomial Eigenvalue Problems with Hamiltonian Structure, (with Volker Mehrmann), Electron. Trans. Numer. Anal., 13 (2002), 106-118.

  6. Structured eigenvalue methods for the computation of corner singularities in 3D anisotropic elastic structures, (with Thomas Apel and Volker Mehrmann), Comput. Methods Appl. Engrg, 191 (2002), 4459-4473.

  7. Fundamentals of Matrix Computations, Second Edition, xiv + 618 pp., John Wiley and Sons, May 2002.

  8. A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures, (with G. Henry and J. Dongarra), SIAM J. Sci. Comput.,24 (2003) 28 & 311.

  9. *On Hamiltonian and Symplectic Lanczos Processes, Linear Algebra Appl., 385 (2004), pp. 23-45.

  10. A Framework Model Based on the Smoluchowski Equation in Two Reaction Coordinates (with Mark Schumaker), J. Chemical Physics, 121 (2004), pp. 6134-6144.

  11. Numerical Solution of Large-scale Structured Polynomial or Rational Eigenvalue Problems (with Thomas Apel and Volker Mehrmann) in Foundations of Computational Mathematics, Minneapolis 2002, London Mathematical Society, Lecture Note Series 312. eds, Felipe Cucker, Ron DeVore, Peter Olver, and Endre Suli. Cambridge University Press (2004) pp. 135-157.



2007-06-05