The Calculation of the Eigenvectors of Codiagonal Matrices. - James Hardy Wilkinson (Comput. J., 1958)

The Calculation of Eigenvectors by the Method of Lanczos. - James Hardy Wilkinson (Comput. J., 1958)

Rounding errors in algebraic processes. - James Hardy Wilkinson (IFIP Congress, 1959)

Stability of the Reduction of a Matrix to Almost Triangular and Triangular Forms by Elementary Similarity Transformations. - James Hardy Wilkinson (J. ACM, 1959)

Householder's Method for the Solution of the Algebraic Eigenproblem. - James Hardy Wilkinson (Comput. J., 1960)

Remarks on algorithms 2 and 3. - James Hardy Wilkinson (Commun. ACM, 1961)

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

Rigorous Error Bounds for Computer Eigensystems. - James Hardy Wilkinson (Comput. J., 1961)

Error Analysis of Direct Methods of Matrix Inversion. - James Hardy Wilkinson (J. ACM, 1961)

Correspondence. - John S. Rollett; James Hardy Wilkinson (Comput. J., 1962)

Instability of the Elimination Method of Reducing a Matrix to Tri-diagonal Form. - James Hardy Wilkinson (Comput. J., 1962)

Convergence of the LR, QR, and Related Algorithms. - James Hardy Wilkinson (Comput. J., 1965)

The QR Algorithm for Real Symmetric Matrices with Multiple Eigenvalues. - James Hardy Wilkinson (Comput. J., 1965)

The calculation of Lamé polynomials. - James Hardy Wilkinson (Comput. J., 1965)

Review: Book Review. - James Hardy Wilkinson (Comput. J., 1967)

Global convergence of QR algorithm. - James Hardy Wilkinson (IFIP Congress (1), 1968)

Eigenvalues of Ax = λBx with band symmetric A and B. - G. Peters; James Hardy Wilkinson (Comput. J., 1969)

The Least Squares Problem and Pseudo-Inverses. - G. Peters; James Hardy Wilkinson (Comput. J., 1970)

Linear algebra. - James Hardy Wilkinson; Christian H. Reinsch (Springer, 1971)

Some Comments from a Numerical Analyst. - James Hardy Wilkinson (J. ACM, 1971)

On the Stability of Gauss-Jordan Elimination with Pivoting. - G. Peters; James Hardy Wilkinson (Commun. ACM, 1975)

Numerical Considerations in Computing Invariant Subspaces. - Jack J. Dongarra; Sven Hammarling; James Hardy Wilkinson (SIAM J. Matrix Anal. Appl., 1992)

Ill-conditioned eigensystems and the computation of the Jordan canonical form. - Gene H. Golub; James Hardy Wilkinson (Milestones in Matrix Computation, 2007)