The Numerical Solution of Separably Stiff Systems by Precise Partitioning. - David S. Watkins; Ralph W. HansonSmith (ACM Trans. Math. Softw., 1983)

Some Perspectives on the Eigenvalue Problem. - David S. Watkins (SIAM Rev., 1993)

QR-like algorithms for the nonsymmetric eigenvalue problem. - J. B. Haag; David S. Watkins (ACM Trans. Math. Softw., 1993)

Bidirectional Chasing Algorithms for the Eigenvalue Problem. - David S. Watkins (SIAM J. Matrix Anal. Appl., 1993)

Shifting Strategies for the Parallel QR Algorithm. - David S. Watkins (SIAM J. Sci. Comput., 1994)

Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem. - David S. Watkins; Ludwig Elsner (SIAM J. Matrix Anal. Appl., 1994)

Forward Stability and Transmission of Shifts in the QR Algorithm. - David S. Watkins (SIAM J. Matrix Anal. Appl., 1995)

A Distributed Memory Implementation of the Nonsymmetric QR Algorithm. - Jack J. Dongarra; Greg Henry; David S. Watkins (PP, 1997)

Institutional research rankings via bibliometric analysis and direct peer review: A comparative case study with policy implications. - P. R. Thomas; David S. Watkins (Scientometrics, 1998)

Bulge Exchanges in Algorithms of QR Type. - David S. Watkins (SIAM J. Matrix Anal. Appl., 1998)

The BR Eigenvalue Algorithm. - George Al Geist II; Gary W. Howell; David S. Watkins (SIAM J. Matrix Anal. Appl., 1999)

Performance of the QZ Algorithm in the Presence of Infinite Eigenvalues. - David S. Watkins (SIAM J. Matrix Anal. Appl., 2000)

A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures. - Greg Henry; David S. Watkins; Jack J. Dongarra (SIAM J. Sci. Comput., 2002)

Product Eigenvalue Problems. - David S. Watkins (SIAM Rev., 2005)

Efficient Implementation of the Multishift QR Algorithm for the Unitary Eigenvalue Problem. - Roden J. A. David; David S. Watkins (SIAM J. Matrix Anal. Appl., 2006)

The matrix eigenvalue problem - GR and Krylov subspace methods. - David S. Watkins (SIAM, 2007)

The QR Algorithm Revisited. - David S. Watkins (SIAM Rev., 2008)

Implicit QR algorithms for palindromic and even eigenvalue problems. - Daniel Kressner; Christian Schröder; David S. Watkins (Numer. Algorithms, 2009)

Francis's Algorithm. - David S. Watkins (Am. Math. Mon., 2011)

A Generalization of the Multishift QR Algorithm. - Raf Vandebril; David S. Watkins (SIAM J. Matrix Anal. Appl., 2012)

Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix. - Jared Lee Aurentz; Raf Vandebril; David S. Watkins (SIAM J. Sci. Comput., 2013)

Fast and Backward Stable Computation of Roots of Polynomials. - Jared Lee Aurentz; Thomas Mach; Raf Vandebril; David S. Watkins (SIAM J. Matrix Anal. Appl., 2015)

Book Reviews. - David S. Watkins (SIAM Rev., 2016)

Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil. - Jared Lee Aurentz; Thomas Mach; Leonardo Robol; Raf Vandebril; David S. Watkins (SIAM J. Matrix Anal. Appl., 2018)

On pole-swapping algorithms for the eigenvalue problem. - Daan Camps; Thomas Mach; Raf Vandebril; David S. Watkins (CoRR, 2019)

Pole-swapping algorithms for alternating and palindromic eigenvalue problems. - Thomas Mach; Raf Vandebril; David S. Watkins (CoRR, 2019)

Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials. - Jared Lee Aurentz; Thomas Mach; Leonardo Robol; Raf Vandebril; David S. Watkins (Math. Comput., 2019)

The RQR algorithm. - Daan Camps; Thomas Mach; Raf Vandebril; David S. Watkins (CoRR, 2024)