We stand with Ukraine  

James Hardy Wilkinson

Affiliations:
  • National Physical Laboratory, Teddington, UK


According to our database1, James Hardy Wilkinson authored at least 23 papers between 1958 and 2007.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

Turing Prize recipient

Turing Prize 1970, "For his research in numerical analysis to facilitate the use of the high-speed digital computer, having received special recognition for his work in computations in linear algebra and "backward" error analysis".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
Ill-conditioned eigensystems and the computation of the Jordan canonical form.
[BibTeX]
Gene H. Golub
,
James Hardy Wilkinson
Proceedings of the Milestones in Matrix Computation, 2007

1992
Numerical Considerations in Computing Invariant Subspaces.
[BibTeX]
[DOI]
Jack J. Dongarra
,
Sven Hammarling
,
James Hardy Wilkinson
SIAM J. Matrix Anal. Appl., 1992

1975
On the Stability of Gauss-Jordan Elimination with Pivoting.
[BibTeX]
[DOI]
G. Peters
,
James Hardy Wilkinson
Commun. ACM, 1975

1971
Some Comments from a Numerical Analyst.
[BibTeX]
[DOI]
James Hardy Wilkinson
J. ACM, 1971

Linear algebra.
[BibTeX]
[DOI]
James Hardy Wilkinson
,
Christian H. Reinsch
Handbook for automatic computation 2, Springer, ISBN: 0387054146, 1971

1970
The Least Squares Problem and Pseudo-Inverses.
[BibTeX]
[DOI]
G. Peters
,
James Hardy Wilkinson
Comput. J., 1970

1969
Eigenvalues of Ax = λBx with band symmetric A and B.
[BibTeX]
[DOI]
G. Peters
,
James Hardy Wilkinson
Comput. J., 1969

1968
Global convergence of <i>QR</i> algorithm.
[BibTeX]
James Hardy Wilkinson
Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1967
Review: Book Review.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1967

1965
The calculation of Lamé polynomials.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1965

The QR Algorithm for Real Symmetric Matrices with Multiple Eigenvalues.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1965

Convergence of the LR, QR, and Related Algorithms.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1965

1962
Instability of the Elimination Method of Reducing a Matrix to Tri-diagonal Form.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1962

Correspondence.
[BibTeX]
[DOI]
John S. Rollett
,
James Hardy Wilkinson
Comput. J., 1962

1961
Error Analysis of Direct Methods of Matrix Inversion.
[BibTeX]
[DOI]
James Hardy Wilkinson
J. ACM, 1961

Rigorous Error Bounds for Computer Eigensystems.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1961

An Efficient Scheme for the Co-diagonalization of a Symmetric Matrix by Givens' Method in a Computer with a Two-level Store.
[BibTeX]
[DOI]
John S. Rollett
,
James Hardy Wilkinson
Comput. J., 1961

Remarks on algorithms 2 and 3.
[BibTeX]
[DOI]
James Hardy Wilkinson
Commun. ACM, 1961

1960
Householder's Method for the Solution of the Algebraic Eigenproblem.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1960

1959
Stability of the Reduction of a Matrix to Almost Triangular and Triangular Forms by Elementary Similarity Transformations.
[BibTeX]
[DOI]
James Hardy Wilkinson
J. ACM, 1959

Rounding errors in algebraic processes.
[BibTeX]
James Hardy Wilkinson
Proceedings of the Information Processing, 1959

1958
The Calculation of Eigenvectors by the Method of Lanczos.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1958

The Calculation of the Eigenvectors of Codiagonal Matrices.
[BibTeX]
[DOI]
James Hardy Wilkinson
Comput. J., 1958


  Loading...