John G. F. Francis

Last updated

John G.F. Francis
Born1934
London
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]

Related Research Articles

<span class="mw-page-title-main">Numerical analysis</span> Study of algorithms using numerical approximation

Numerical analysis is the study of algorithms that use numerical approximation for the problems of mathematical analysis. It is the study of numerical methods that attempt at finding approximate solutions of problems rather than the exact ones. Numerical analysis finds application in all fields of engineering and the physical sciences, and in the 21st century also the life and social sciences, medicine, business and even the arts. Current growth in computing power has enabled the use of more complex numerical analysis, providing detailed and realistic mathematical models in science and engineering. Examples of numerical analysis include: ordinary differential equations as found in celestial mechanics, numerical linear algebra in data analysis, and stochastic differential equations and Markov chains for simulating living cells in medicine and biology.

In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation.

<span class="mw-page-title-main">James H. Wilkinson</span>

James Hardy Wilkinson FRS was a prominent figure in the field of numerical analysis, a field at the boundary of applied mathematics and computer science particularly useful to physics and engineering.

In the mathematical discipline of linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition. It allows one to write an arbitrary complex square matrix as unitarily equivalent to an upper triangular matrix whose diagonal elements are the eigenvalues of the original matrix.

The following timeline of algorithms outlines the development of algorithms since their inception.

In numerical linear algebra, the QR algorithm or QR iteration is an eigenvalue algorithm: that is, a procedure to calculate the eigenvalues and eigenvectors of a matrix. The QR algorithm was developed in the late 1950s by John G. F. Francis and by Vera N. Kublanovskaya, working independently. The basic idea is to perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors in the reverse order, and iterate.

Computational science, also known as scientific computing, technical computing or scientific computation (SC), is a division of science that uses advanced computing capabilities to understand and solve complex physical problems. This includes

In linear algebra, it is often important to know which vectors have their directions unchanged by a linear transformation. An eigenvector or characteristic vector is a such a vector. Thus an eigenvector of a linear transformation is scaled by a constant factor when the linear transformation is applied to it: . The corresponding eigenvalue, characteristic value, or characteristic root is the multiplying factor .

<span class="mw-page-title-main">Gene H. Golub</span> American mathematician

Gene Howard Golub, was an American numerical analyst who taught at Stanford University as Fletcher Jones Professor of Computer Science and held a courtesy appointment in electrical engineering.

Charles Francis Van Loan is an emeritus professor of computer science and the Joseph C. Ford Professor of Engineering at Cornell University, He is known for his expertise in numerical analysis, especially matrix computations.

In linear algebra, if are complex matrices for some nonnegative integer , and , then the matrix pencil of degree is the matrix-valued function defined on the complex numbers

Numerical linear algebra, sometimes called applied linear algebra, is the study of how matrix operations can be used to create computer algorithms which efficiently and accurately provide approximate answers to questions in continuous mathematics. It is a subfield of numerical analysis, and a type of linear algebra. Computers use floating-point arithmetic and cannot exactly represent irrational data, so when a computer algorithm is applied to a matrix of data, it can sometimes increase the difference between a number stored in the computer and the true number that it is an approximation of. Numerical linear algebra uses properties of vectors and matrices to develop computer algorithms that minimize the error introduced by the computer, and is also concerned with ensuring that the algorithm is as efficient as possible.

Vera Nikolaevna Kublanovskaya was a Russian mathematician noted for her work on developing computational methods for solving spectral problems of algebra. She proposed the QR algorithm for computing eigenvalues and eigenvectors in 1961, which has been named as one of the ten most important algorithms of the twentieth century. This algorithm was proposed independently by the English computer scientist John G.F. Francis in 1959.

In numerical analysis, Gauss–Legendre quadrature is a form of Gaussian quadrature for approximating the definite integral of a function. For integrating over the interval [−1, 1], the rule takes the form:

The following is a timeline of scientific computing, also known as computational science.

The following is a timeline of numerical analysis after 1945, and deals with developments after the invention of the modern electronic computer, which began during Second World War. For a fuller history of the subject before this period, see timeline and history of mathematics.

This is a timeline of key developments in computational mathematics.

Validated numerics, or rigorous computation, verified computation, reliable computation, numerical verification is numerics including mathematically strict error evaluation, and it is one field of numerical analysis. For computation, interval arithmetic is used, and all results are represented by intervals. Validated numerics were used by Warwick Tucker in order to solve the 14th of Smale's problems, and today it is recognized as a powerful tool for the study of dynamical systems.

Beresford Neill Parlett is an English applied mathematician, specializing in numerical analysis and scientific computation.

Christian Reinsch was a German mathematician who worked in the area of numerical analysis.

References

  1. ↑ 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.
  2. ↑ 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
  3. ↑ 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).
  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).
  5. 1 2 Gene Golub (2007), John Francis, Co-Inventor of QR, NA-Net mailing list, 19 August 2007.
  6. ↑ Frank Uhlig (2009), John Francis and 50 years of QR, NA-Net mailing list, 25 March 2009.
  7. ↑ "John Francis". University of Sussex. Retrieved 24 May 2016.

Further reading

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.