default search action
David S. Watkins
Person information
- affiliation: Washington State University, Pullman, WA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j34]Jared Lee Aurentz
, Thomas Mach, Leonardo Robol
Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials. Math. Comput. 88(315): 313-347 (2019) - [i2]Daan Camps, Thomas Mach, Raf Vandebril, David S. Watkins:
On pole-swapping algorithms for the eigenvalue problem. CoRR abs/1906.08672 (2019) - [i1]Thomas Mach, Raf Vandebril, David S. Watkins:
Pole-swapping algorithms for alternating and palindromic eigenvalue problems. CoRR abs/1906.09942 (2019) - 2018
- [j33]Jared Lee Aurentz
Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil. SIAM J. Matrix Anal. Appl. 39(3): 1245-1269 (2018) - 2017
- [j32]David S. Watkins:
Book Reviews. SIAM Rev. 59(1): 207-222 (2017) - [j31]David S. Watkins:
Book Reviews. SIAM Rev. 59(2): 449-465 (2017) - [j30]David S. Watkins:
Book Reviews. SIAM Rev. 59(3): 681-699 (2017) - [j29]David S. Watkins:
Book Reviews. SIAM Rev. 59(4): 915-928 (2017) - 2016
- [j28]David S. Watkins:
Book Reviews. SIAM Rev. 58(1): 159-173 (2016) - [j27]David S. Watkins:
Book Reviews. SIAM Rev. 58(2): 357-374 (2016) - [j26]David S. Watkins:
Book Reviews. SIAM Rev. 58(3): 577-599 (2016) - [j25]David S. Watkins:
Book Reviews. SIAM Rev. 58(4): 795-807 (2016) - 2015
- [j24]Jared Lee Aurentz
Fast and Backward Stable Computation of Roots of Polynomials. SIAM J. Matrix Anal. Appl. 36(3): 942-973 (2015) - [j23]David S. Watkins:
Book Reviews. SIAM Rev. 57(1): 153-164 (2015) - [j22]David S. Watkins:
Book Reviews. SIAM Rev. 57(2): 295-318 (2015) - [j21]David S. Watkins:
Book Reviews. SIAM Rev. 57(3): 469-480 (2015) - [j20]David S. Watkins:
Book Reviews. SIAM Rev. 57(4): 627-643 (2015) - 2013
- [j19]Jared Lee Aurentz
Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix. SIAM J. Sci. Comput. 35(1) (2013) - 2012
- [j18]Raf Vandebril
A Generalization of the Multishift QR Algorithm. SIAM J. Matrix Anal. Appl. 33(3): 759-779 (2012) - 2011
- [j17]David S. Watkins:
Francis's Algorithm. Am. Math. Mon. 118(5): 387-403 (2011)
2000 – 2009
- 2009
- [j16]Daniel Kressner
Implicit QR algorithms for palindromic and even eigenvalue problems. Numer. Algorithms 51(2): 209-238 (2009) - 2008
- [j15]David S. Watkins:
The QR Algorithm Revisited. SIAM Rev. 50(1): 133-145 (2008) - 2007
- [b1]David S. Watkins:
The matrix eigenvalue problem - GR and Krylov subspace methods. SIAM 2007, ISBN 978-0-89871-641-2, pp. I-X, 1-442 - 2006
- [j14]Roden J. A. David, David S. Watkins:
Efficient Implementation of the Multishift QR Algorithm for the Unitary Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 28(3): 623-633 (2006) - 2005
- [j13]David S. Watkins:
Product Eigenvalue Problems. SIAM Rev. 47(1): 3-40 (2005) - 2002
- [j12]Greg Henry, David S. Watkins, Jack J. Dongarra:
A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures. SIAM J. Sci. Comput. 24(1): 284-311 (2002) - 2000
- [j11]David S. Watkins:
Performance of the QZ Algorithm in the Presence of Infinite Eigenvalues. SIAM J. Matrix Anal. Appl. 22(2): 364-375 (2000)
1990 – 1999
- 1999
- [j10]George Al Geist II, Gary W. Howell, David S. Watkins:
The BR Eigenvalue Algorithm. SIAM J. Matrix Anal. Appl. 20(4): 1083-1098 (1999) - 1998
- [j9]P. R. Thomas, David S. Watkins:
Institutional research rankings via bibliometric analysis and direct peer review: A comparative case study with policy implications. Scientometrics 41(3): 335-355 (1998) - [j8]David S. Watkins:
Bulge Exchanges in Algorithms of QR Type. SIAM J. Matrix Anal. Appl. 19(4): 1074-1096 (1998) - 1997
- [c1]Jack J. Dongarra, Greg Henry, David S. Watkins:
A Distributed Memory Implementation of the Nonsymmetric QR Algorithm. PP 1997 - 1995
- [j7]David S. Watkins:
Forward Stability and Transmission of Shifts in the QR Algorithm. SIAM J. Matrix Anal. Appl. 16(2): 469-487 (1995) - 1994
- [j6]David S. Watkins, Ludwig Elsner:
Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 15(3): 943-967 (1994) - [j5]David S. Watkins:
Shifting Strategies for the Parallel QR Algorithm. SIAM J. Sci. Comput. 15(4): 953-958 (1994) - 1993
- [j4]David S. Watkins:
Bidirectional Chasing Algorithms for the Eigenvalue Problem. SIAM J. Matrix Anal. Appl. 14(1): 166-179 (1993) - [j3]David S. Watkins:
Some Perspectives on the Eigenvalue Problem. SIAM Rev. 35(3): 430-471 (1993) - [j2]J. B. Haag, David S. Watkins:
QR-like algorithms for the nonsymmetric eigenvalue problem. ACM Trans. Math. Softw. 19(3): 407-418 (1993)
1980 – 1989
- 1983
- [j1]David S. Watkins, Ralph W. HansonSmith:
The Numerical Solution of Separably Stiff Systems by Precise Partitioning. ACM Trans. Math. Softw. 9(3): 293-301 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: