default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Hardy Wilkinson
Person information
- award: Turing Award, 1970
- affiliation: National Physical Laboratory, Teddington, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[p1]Gene H. Golub, James Hardy Wilkinson:
Ill-conditioned eigensystems and the computation of the Jordan canonical form. Milestones in Matrix Computation 2007: 485-527
1990 – 1999
- 1992
- [j21]Jack J. Dongarra, Sven Hammarling, James Hardy Wilkinson:
Numerical Considerations in Computing Invariant Subspaces. SIAM J. Matrix Anal. Appl. 13(1): 145-161 (1992)
1970 – 1979
- 1975
- [j20]G. Peters, James Hardy Wilkinson:
On the Stability of Gauss-Jordan Elimination with Pivoting. Commun. ACM 18(1): 20-24 (1975) - 1971
- [b1]James Hardy Wilkinson, Christian H. Reinsch:
Linear algebra. Handbook for automatic computation 2, Springer 1971, ISBN 0387054146, pp. I-VIII, 1-439 - [j19]James Hardy Wilkinson:
Some Comments from a Numerical Analyst. J. ACM 18(2): 137-147 (1971) - 1970
- [j18]G. Peters, James Hardy Wilkinson:
The Least Squares Problem and Pseudo-Inverses. Comput. J. 13(3): 309-316 (1970)
1960 – 1969
- 1969
- [j17]G. Peters, James Hardy Wilkinson:
Eigenvalues of Ax = λBx with band symmetric A and B. Comput. J. 12(4): 398-404 (1969) - 1968
- [c2]James Hardy Wilkinson:
Global convergence of QR algorithm. IFIP Congress (1) 1968: 130-133 - 1967
- [j16]James Hardy Wilkinson:
Review: Book Review. Comput. J. 10(1): 77 (1967) - 1965
- [j15]James Hardy Wilkinson:
Convergence of the LR, QR, and Related Algorithms. Comput. J. 8(1): 77-84 (1965) - [j14]James Hardy Wilkinson:
The QR Algorithm for Real Symmetric Matrices with Multiple Eigenvalues. Comput. J. 8(1): 85-87 (1965) - [j13]James Hardy Wilkinson:
The calculation of Lamé polynomials. Comput. J. 8(3): 273-277 (1965) - 1963
- [j12]James Hardy Wilkinson:
Review: Book Review. Comput. J. 5(4): 263 (1963) - 1962
- [j11]John S. Rollett, James Hardy Wilkinson:
Correspondence. Comput. J. 4(4): 279 (1962) - [j10]James Hardy Wilkinson:
Review: Book Review. Comput. J. 5(1): 32 (1962) - [j9]James Hardy Wilkinson:
Instability of the Elimination Method of Reducing a Matrix to Tri-diagonal Form. Comput. J. 5(1): 61-70 (1962) - 1961
- [j8]James Hardy Wilkinson:
Remarks on algorithms 2 and 3. Commun. ACM 4(3): 153 (1961) - [j7]John S. Rollett, James Hardy Wilkinson:
An Efficient Scheme for the Co-diagonalization of a Symmetric Matrix by Givens' Method in a Computer with a Two-level Store. Comput. J. 4(2): 177-180 (1961) - [j6]James Hardy Wilkinson:
Rigorous Error Bounds for Computer Eigensystems. Comput. J. 4(3): 230-241 (1961) - [j5]James Hardy Wilkinson:
Error Analysis of Direct Methods of Matrix Inversion. J. ACM 8(3): 281-330 (1961) - 1960
- [j4]James Hardy Wilkinson:
Householder's Method for the Solution of the Algebraic Eigenproblem. Comput. J. 3(1): 23-27 (1960)
1950 – 1959
- 1959
- [j3]James Hardy Wilkinson:
Stability of the Reduction of a Matrix to Almost Triangular and Triangular Forms by Elementary Similarity Transformations. J. ACM 6(3): 336-359 (1959) - [c1]James Hardy Wilkinson:
Rounding errors in algebraic processes. IFIP Congress 1959: 44-53 - 1958
- [j2]James Hardy Wilkinson:
The Calculation of the Eigenvectors of Codiagonal Matrices. Comput. J. 1(2): 90-96 (1958) - [j1]James Hardy Wilkinson:
The Calculation of Eigenvectors by the Method of Lanczos. Comput. J. 1(3): 148-152 (1958)
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-04-25 05:50 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:
