Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Davenport, James
University of Bath
Bath, United Kingdom
 
   Featured Reviewer
   Reader Recommended
   Reviewer Selected
   Highlighted
Follow this Reviewer
 
 
 

In 1969, the team that developed the ATM at IBM Hursley (UK) used parts from that project to build an IBM School Computer, as a community outreach project, and it toured the region. When it came to James Davenport’s school, he (at age 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 therefore used this to implement Draim's algorithm from his father's book, The Higher Arithmetic, and was testing eight-digit numbers for primality until the teacher’s patience wore out.

This is typical of Davenport’s lifelong interests: pushing computers to their limits to do mathematical computations. He worked in a government laboratory for nine months, again writing and using multiword arithmetic, but also using his knowledge of number theory to solve a problem in hashing, which earned him his first published paper at 18. He went to Cambridge University (Bachelor’s in 1974, Master’s in 1978, and PhD in 1980), to IBM Yorktown Heights for a year, back to Cambridge as a Research Fellow, to Grenoble for a year, which significantly improved his French, as well as his cooking, before going to the relatively new University of Bath “for a couple of years" in 1983. He is still there, though he has also spent time researching and teaching in many other countries. In 1986 in France, he finished his textbook Calcul Formel with Grenoble colleagues, which his mother translated into English as Computer Algebra.

Computer algebra remains his main research interest: as he says, “You don't really understand a subject until you can program a computer do to it, and that goes for mathematics at least as much as anything else.” He is finishing a new textbook on the subject, and has also edited four volumes of conference proceedings on the subject, as well as writing over 100 refereed papers. He has also produced four new editions of The Higher Arithmetic. He is active in the UK's professional world as a vice-president of the British Computer Society, the representative of the Institute of Mathematics and Its Applications on the London Mathematical Society’s Computer Science Committee, and a member of the Outer Circle of the National Advisory Committee on [School] Mathematics Education. In 2014, he was one of only two computer scientists chosen among the 55 national teaching fellows (and Tom Crick, the other one, had studied at Bath). Internationally, he is on the Committee for Electronic Information and Communication of the International Mathematical Union, and just moderated the panel on mathematical MOOCs at the 2014 International Congress of Mathematicians.

Is he a mathematician or a computer scientist? “Yes, and if that were a conjunction rather than a disjunction, I would still say yes. What attracted me to Bath was that mathematics and computer science were one department, and when colleagues felt that growth made a split necessary, I was made a member of both departments.”

What attracts him most to Computing Reviews is the ability to read books and papers he would not otherwise read. “We examine PhD students, not just on their thesis, but also on the broader area. How do we professors keep up ourselves? Reviewing for Computing Reviews is my way.”

 
 
Options:
Date Reviewed  
 
1
- 6 of 6 reviews

   
   European Language Grid: a language technology platform for multilingual Europe
Rehm G., Springer International Publishing, Cham, Switzerland, 2022. 390 pp.  Type: Book (3031172574)

This edited book is an outcome of the European Language Grid (ELG), a European Union (EU)-funded project that formally ran from January 2019 to June 2022 (but note the platform was updated the month this review was written, so the project certainl...

Jun 14 2023  
   Millions, billions, zillions: defending yourself in a world of too many numbers
Kernighan B., PRINCETON UNIVERSITY PRESS, Princeton, NJ, 2018. 176 pp.  Type: Book (978-0-691182-77-3)

This book is simultaneously entertaining, instructive (one might say educational), and worrying. After an (important) opening chapter, the author analyzes a statement from Newsweek that the US should tap into the Strategic Petro...

Jun 4 2019  
   Solving very sparse rational systems of equations
Cook W., Steffy D. ACM Transactions on Mathematical Software 37(4): 1-21, 2011.  Type: Article

This paper does exactly what its title says, in the context of linear programming. It begins with an excellent review of the literature on the subject, and then considers four main techniques: Dixon’s p-adi...

Oct 26 2011  
   Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of π calculation
Takahashi D. Parallel Computing 36(8): 439-448, 2010.  Type: Article

In this paper, Takahashi describes an apparently impressive computation, of 2.576 x 1012 decimal digits of &pgr;, in 29 hours on a 10240-core parallel processor with 16384 GB of memory. Note that, at its most efficient, ...

Oct 25 2011  
   Adaptive Winograd’s matrix multiplications
D’Alberto P., Nicolau A. ACM Transactions on Mathematical Software 36(1): 1-23, 2009.  Type: Article

Strassen’s matrix multiplication, generally used in the Winograd variant [1], is an attractive theoretical toy. Furthermore, it can be described quite easily if we ignore issues such as the inefficiency for small matrix sizes...

Jul 2 2009  
   Real root isolation for exp-log functions
Strzebonski A.  Symbolic and algebraic computation (Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, Linz/Hagenberg, Austria, Jul 20-23, 2008) 303-314, 2008.  Type: Proceedings

Exp-log functions f are, roughly speaking, built up from polynomials by algebraic operations, exponentiation, and taking logarithms; therefore, they include reciprocals and radicals. This paper is concerned with root...

Sep 11 2008  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy