John G. F. Francis
John G.F. Francis | |
|---|---|
| Born | 1934 |
| Known for | QR algorithm |
John G.F. Francis (born 1934) is an English computer scientist, who in 1961 published the QR algorithm for computing the eigenvalues and eigenvectors of matrices,[1] which has been named as one of the ten most important algorithms of the twentieth century.[2][3] The algorithm was also proposed independently by Vera N. Kublanovskaya of the Soviet Union in the same year.[4]
Francis was born in London in 1934. In 1954 he worked for the National Research Development Corporation (NRDC). In 1955–1956 he attended Cambridge University, but did not complete a degree. He then returned to the NRDC, where he served as assistant to Christopher Strachey. At this time he devised the QR transformation. In 1961 he left the NRDC to work at Ferranti Corporation, Ltd. and then at the University of Sussex. Subsequently, he had positions with various industrial organizations and consultancies. His interests encompassed artificial intelligence, computer languages, and systems engineering, although he never returned to the field of numerical computation.[5]
By 1962, Francis had left the field of numerical analysis, and subsequently had no idea of the impact his work on the QR algorithm had had, until re-contacted by Gene Golub and Frank Uhlig in 2007, by which time he was retired and living in Hove, England (near Brighton).[5] Still in good health, he was the opening speaker at a mini-symposium that marked 50 years of the QR algorithm, held at the 23rd Biennial Conference on Numerical Analysis in Glasgow in June 2009.[6] Francis was awarded a University of Sussex honorary doctorate in July 2015.[7]
References
[edit]- ^ J.G.F. Francis, "The QR Transformation, I", The Computer Journal, 4(3), pages 265–271 (1961, received October 1959) online at oxfordjournals.org; J.G.F. Francis, "The QR Transformation, II" The Computer Journal, 4(4), pages 332–345 (1962) online at oxfordjournals.org.
- ^ Jack Dongarra, Francis Sullivan (2000), "Guest Editors' Introduction: The Top 10 Algorithms", Computing in Science and Engineering, 2 (1), pp. 22–23, Jan./Feb. 2000, doi:10.1109/MCISE.2000.814652
- ^ Barry Arthur Cipra (2000), "The Best of the 20th Century: Editors Name Top 10 Algorithms Archived 28 March 2018 at the Wayback Machine", SIAM News, 33 (4).
- ^ Vera N. Kublanovskaya (1961), "On some algorithms for the solution of the complete eigenvalue problem," USSR Computational Mathematics and Mathematical Physics, 1(3), pages 637–657 (1963, received Feb 1961). Also published in: Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki [Journal of Computational Mathematics and Mathematical Physics], 1(4), pages 555–570 (1961).
- ^ a b Gene Golub (2007), John Francis, Co-Inventor of QR, NA-Net mailing list, 19 August 2007.
- ^ Frank Uhlig (2009), John Francis and 50 years of QR, NA-Net mailing list, 25 March 2009.
- ^ "John Francis". University of Sussex. Retrieved 24 May 2016.
Further reading
[edit]- Gene Golub, Frank Uhlig (2009), "The QR algorithm: 50 years later – its genesis by John Francis and Vera Kublanovskaya, and subsequent developments", IMA Journal of Numerical Analysis, vol. 29, no. 3, pages 467-485.advanced publication online doi:10.1093/imanum/drp012