James Davenport | |
---|---|
Born | James Harold Davenport 26 September 1953[ citation needed ] |
Education | Marlborough College |
Alma mater | University of Cambridge (BA, PhD) |
Awards | National Teaching Fellowship (2014) |
Scientific career | |
Fields | Cryptography Computer algebra systems [1] |
Institutions | University of Bath |
Thesis | On the integration of algebraic functions (1979) |
Doctoral advisor | John ffitch Arthur Norman [2] |
Website | people |
James Harold Davenport (born 26 September 1953) is a British computer scientist who works in computer algebra. Having done his PhD and early research at the Computer Laboratory, University of Cambridge, he is the Hebron and Medlock Professor of Information Technology at the University of Bath in Bath, England. [1] [3]
Davenport was educated at Marlborough College, and was then a student at Trinity College, Cambridge. [4] He was awarded a Bachelor of Arts degree in 1974, which was converted to a Master of Arts degree in 1978, and a Master of Mathematics in 2011. He was awarded a PhD in 1980. [2] [5]
In 1969, the team that developed the automated teller machine in the United Kingdom at IBM Hursley used parts from that project to build an IBM School Computer. It was a community outreach project, and it went on tour. When it came to Marlborough College, Davenport, aged 16, discovered that, although it was ostensibly a six-digit computer, the microcode had access to a 12-digit internal register to do multiply/divide. He used this to implement Draim's algorithm from his father Harold Davenport's book, The Higher Arithmetic, and tested eight-digit numbers for primality. [6]
Between school and university, Davenport worked in a government laboratory for nine months, again writing and using multiword arithmetic, but also using number theory to solve a problem in hashing, which was published. He was at IBM Yorktown Heights for a year, and returned to Cambridge as a Research Fellow. He went to Grenoble for a year, before taking a post at the University of Bath in 1983. [6]
Davenport is an author of a textbook about computer algebra and of many papers. [7] [8] [9] [10] He has been Project Chair of the European OpenMath Project and its successor Thematic Network, with responsibilities for aligning OpenMath and MathML, producing Content Dictionaries and supervised a Reduce-based OpenMath/MathML translator, and was Treasurer of the European Mathematical Trust. He was Founding Editor-in-Chief of the London Mathematical Society's Journal of Computation and Mathematics . [11]
Davenport was awarded the Honorary Degree of Doctor of Science in September 2019 by the West University of Timişoara, Romania. This was in recognition of his pioneering and ongoing work in computer algebra systems and theory of symbolic computation.
In 2014, Davenport was awarded a National Teaching Fellowship by the Higher Education Academy.
He was awarded the Bronze Medal of the University of Helsinki in 2001.
From January to June 2017 Davenport was a Fulbright CyberSecurity Scholar at New York University, [12] and maintained a blog [13] over the same period.
In 2024, he was awarded Honorary Fellowship of BCS, The Chartered Institute for IT after many years service, including as a Vice-President. [14]
Davenport is the son of the mathematician Harold Davenport.
A computer algebra system (CAS) or symbolic algebra system (SAS) is any mathematical software with the ability to manipulate mathematical expressions in a way similar to the traditional manual computations of mathematicians and scientists. The development of the computer algebra systems in the second half of the 20th century is part of the discipline of "computer algebra" or "symbolic computation", which has spurred work in algorithms over mathematical objects such as polynomials.
David Harold Bailey is a mathematician and computer scientist. He received his B.S. in mathematics from Brigham Young University in 1972 and his Ph.D. in mathematics from Stanford University in 1976. He worked for 14 years as a computer scientist at NASA Ames Research Center, and then from 1998 to 2013 as a Senior Scientist at the Lawrence Berkeley National Laboratory. He is now retired from the Berkeley Lab.
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.
David Bryant Mumford is an American mathematician known for his work in algebraic geometry and then for research into vision and pattern theory. He won the Fields Medal and was a MacArthur Fellow. In 2010 he was awarded the National Medal of Science. He is currently a University Professor Emeritus in the Division of Applied Mathematics at Brown University.
Axiom is a free, general-purpose computer algebra system. It consists of an interpreter environment, a compiler and a library, which defines a strongly typed hierarchy.
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry. Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and post-quantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and Swinnerton-Dyer conjecture, the ABC conjecture, the modularity conjecture, the Sato-Tate conjecture, and explicit aspects of the Langlands program.
Klaus Friedrich Roth was a German-born British mathematician who won the Fields Medal for proving Roth's theorem on the Diophantine approximation of algebraic numbers. He was also a winner of the De Morgan Medal and the Sylvester Medal, and a Fellow of the Royal Society.
Samson Abramsky is a British computer scientist who is a Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021.
Harold Davenport FRS was an English mathematician, known for his extensive work in number theory.
Mathematical software is software used to model, analyze or calculate numeric, symbolic or geometric data.
Bruno Buchberger is Professor of Computer Mathematics at Johannes Kepler University in Linz, Austria. In his 1965 Ph.D. thesis, he created the theory of Gröbner bases, and has developed this theory throughout his career. He named these objects after his advisor Wolfgang Gröbner. Since 1995, he has been active in the Theorema project at the University of Linz.
William Gilbert Strang is an American mathematician known for his contributions to finite element theory, the calculus of variations, wavelet analysis and linear algebra. He has made many contributions to mathematics education, including publishing mathematics textbooks. Strang was the MathWorks Professor of Mathematics at the Massachusetts Institute of Technology. He taught Linear Algebra, Computational Science, and Engineering, Learning from Data, and his lectures are freely available through MIT OpenCourseWare.
Bryan John Birch FRS is a British mathematician. His name has been given to the Birch and Swinnerton-Dyer conjecture.
John Peter Fitch is a computer scientist, mathematician and composer, who has worked on relativity, planetary astronomy, computer algebra and Lisp. Alongside Victor Lazzarini and Steven Yi, he is the project leader for audio programming language Csound, having a leading role in its development since the early 1990s; and he was a director of Codemist Ltd, which developed the Norcroft C compiler.
FriCAS is a general purpose computer algebra system with a strong focus on mathematical research and development of new algorithms. It comprises an interpreter, a compiler and a still-growing library of more than 1,000 domains and categories.
In mathematics and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. Although computer algebra could be considered a subfield of scientific computing, they are generally considered as distinct fields because scientific computing is usually based on numerical computation with approximate floating point numbers, while symbolic computation emphasizes exact computation with expressions containing variables that have no given value and are manipulated as symbols.
PARI/GP is a computer algebra system with the main aim of facilitating number theory computations. Versions 2.1.0 and higher are distributed under the GNU General Public License. It runs on most common operating systems.
Gopal Prasad is an Indian-American mathematician. His research interests span the fields of Lie groups, their discrete subgroups, algebraic groups, arithmetic groups, geometry of locally symmetric spaces, and representation theory of reductive p-adic groups.