Anders C. Hansen

Last updated
Anders C. Hansen
Anders C Hansen Image.jpg
NationalityNorwegian
Alma mater University of Cambridge
University of California, Berkeley
Norwegian University of Science and Technology
Known for Mathematical analysis
Foundations of mathematics (computational)
Data science
Awards Whitehead Prize (2019)
IMA Prize in Mathematics and its Applications (2018)
Leverhulme Prize (2017)
Royal Society University Research Fellowship (2012) [1]
Scientific career
FieldsMathematics
Institutions University of Cambridge
University of Oslo
California Institute of Technology
Doctoral advisor Arieh Iserles [2]
Website www.damtp.cam.ac.uk/research/afha/anders/

Anders C. Hansen is a Norwegian mathematician, who is currently a Professor of Mathematics at University of Cambridge, where he is the head of the Applied Functional and Harmonic Analysis group, and also Professor II at the University of Oslo. [3] He works in functional analysis, harmonic analysis (applied), foundations of mathematics (computational), data science and numerical analysis . [4]

Contents

Education

Hansen studied mathematics at the University of Cambridge, University of California, Berkeley and the Norwegian University of Science and Technology, where he was awarded a PhD (2008), a MA (2005) and a BA (2002) respectively. [5]

Career and research

He was a von Kármán instructor at California Institute of Technology from 2008 to 2009, held a junior research fellowship at Homerton College, Cambridge from 2009 to 2012, and held a Marie Skłodowska-Curie Actions fellowship at the University of Vienna in 2012. Since 2012, he has held a Royal Society University Research Fellowship (URF) [1] at the University of Cambridge, where he is now a professor at the Faculty of Mathematics, University of Cambridge and a Bye-Fellow of Peterhouse. [6]

Among other results, he has established the Solvability Complexity Index (SCI) and its following classification hierarchy. [7] [8] [9] [10] [11] It is linked [8] to Steve Smale's question [12] on the existence of iterative convergent algorithms for polynomial root finding answered by Curt McMullen [13] [14] and Peter Doyle, [14] as well as Alan Turing's work and the Arithmetical hierarchy.

Awards and honours

In 2017, he was awarded the Leverhulme Prize for having "solved very hard problems and opened new directions in areas of great impact in applied analysis [...] Notably, by introducing the Solvability Complexity Index he has made a major contribution to the advancement of Smale’s programme on the foundation of computational mathematics". [15] [16] In 2018, he was awarded the IMA Prize in Mathematics and its Applications [17] for having "made a transformative impact on the mathematical sciences and their applications [...] in particular, for his development of the Solvability Complexity Index and its corresponding classification hierarchy". [18] In 2019, he was awarded the Whitehead Prize of the London Mathematical Society for having "contributed fundamentally to the mathematics of data, sampling theory, computational harmonic analysis and compressed sensing" and "especially his development of the Solvability Complexity Index and its corresponding classification hierarchy ". [19]

Selected publications

Research articles
Research expository highlights
Books

Related Research Articles

<span class="mw-page-title-main">Algorithm</span> Sequence of operations for a task

In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes and deduce valid inferences, achieving automation eventually. Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as "memory", "search" and "stimulus".

The P versus NP problem is a major unsolved problem in theoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm.

In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem with input size n is in NC if there exist constants c and k such that it can be solved in time O((log n)c) using O(nk) parallel processors. Stephen Cook coined the name "Nick's class" after Nick Pippenger, who had done extensive research on circuits with polylogarithmic depth and polynomial size.

<span class="mw-page-title-main">Stephen Smale</span> American mathematician (born 1930)

Stephen Smale is an American mathematician, known for his research in topology, dynamical systems and mathematical economics. He was awarded the Fields Medal in 1966 and spent more than three decades on the mathematics faculty of the University of California, Berkeley, where he currently is Professor Emeritus, with research interests in algorithms, numerical analysis and global analysis.

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation, such as the theory of computation, formal language theory, the lambda calculus and type theory.

<span class="mw-page-title-main">Jack Dongarra</span> American computer scientist (born 1950)

Jack Joseph Dongarra is an American computer scientist and mathematician. He is a University Distinguished Professor of Computer Science in the Electrical Engineering and Computer Science Department at the University of Tennessee. He holds the position of a Distinguished Research Staff member in the Computer Science and Mathematics Division at Oak Ridge National Laboratory, Turing Fellowship in the School of Mathematics at the University of Manchester, and is an adjunct professor and teacher in the Computer Science Department at Rice University. He served as a faculty fellow at the Texas A&M University Institute for Advanced Study (2014–2018). Dongarra is the founding director of the Innovative Computing Laboratory at the University of Tennessee. He was the recipient of the Turing Award in 2021.

<span class="mw-page-title-main">Martin Davis (mathematician)</span> American mathematician (1928–2023)

Martin David Davis was an American mathematician and computer scientist who contributed to the fields of computability theory and mathematical logic. His work on Hilbert's tenth problem led to the MRDP theorem. He also advanced the Post–Turing model and co-developed the Davis–Putnam–Logemann–Loveland (DPLL) algorithm, which is foundational for Boolean satisfiability solvers.

<span class="mw-page-title-main">Leslie Valiant</span> British American computer scientist

Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".

Lloyd Nicholas Trefethen is an American mathematician, professor of numerical analysis and head of the Numerical Analysis Group at the Mathematical Institute, University of Oxford.

Smale's problems are a list of eighteen unsolved problems in mathematics proposed by Steve Smale in 1998 and republished in 1999. Smale composed this list in reply to a request from Vladimir Arnold, then vice-president of the International Mathematical Union, who asked several mathematicians to propose a list of problems for the 21st century. Arnold's inspiration came from the list of Hilbert's problems that had been published at the beginning of the 20th century.

The Leslie Fox Prize for Numerical Analysis of the Institute of Mathematics and its Applications (IMA) is a biennial prize established in 1985 by the IMA in honour of mathematician Leslie Fox (1918-1992). The prize honours "young numerical analysts worldwide", and applicants submit papers for review. A committee reviews the papers, invites shortlisted candidates to give lectures at the Leslie Fox Prize meeting, and then awards First Prize and Second Prizes based on "mathematical and algorithmic brilliance in tandem with presentational skills."

In computing, especially computational geometry, a real RAM is a mathematical model of a computer that can compute with exact real numbers instead of the binary fixed point or floating point numbers used by most actual computers. The real RAM was formulated by Michael Ian Shamos in his 1978 Ph.D. dissertation.

Nathan (Nati) Linial is an Israeli mathematician and computer scientist, a professor in the Rachel and Selim Benin School of Computer Science and Engineering at the Hebrew University of Jerusalem, and an ISI highly cited researcher.

<span class="mw-page-title-main">Criss-cross algorithm</span> Method for mathematical optimization

In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm also solve more general problems with linear inequality constraints and nonlinear objective functions; there are criss-cross algorithms for linear-fractional programming problems, quadratic-programming problems, and linear complementarity problems.

<span class="mw-page-title-main">Michael Shub</span> American mathematician

Michael Ira Shub is an American mathematician who has done research into dynamical systems and the complexity of real number algorithms.

Peter Bürgisser is a Swiss mathematician and theoretical computer scientist who deals with algorithmic algebra and algebraic complexity theory.

<span class="mw-page-title-main">Felipe Cucker</span> Uruguayan mathematician

Juan Felipe Cucker Farkas is an Uruguayan mathematician and theoretical computer scientist who has done research into the complexity theory of the Blum–Shub–Smale computational model and the complexity of numerical algorithms in linear programming and numerical algebraic geometry.

James Milton Renegar Jr. is an American mathematician, specializing in optimization algorithms for linear programming and nonlinear programming.

Probabilistic numerics is an active field of study at the intersection of applied mathematics, statistics, and machine learning centering on the concept of uncertainty in computation. In probabilistic numerics, tasks in numerical analysis such as finding numerical solutions for integration, linear algebra, optimization and simulation and differential equations are seen as problems of statistical, probabilistic, or Bayesian inference.

References

  1. 1 2 "Royal Society announces prestigious University Research Fellowships for 2012 | The Royal Society".
  2. ↑ Anders C. Hansen at the Mathematics Genealogy Project
  3. ↑ "Anders Hansen's homepage at the University of Oslo".
  4. ↑ "Anders Hansen - Applied Functional and Harmonic Analysis". www.damtp.cam.ac.uk. Retrieved 2024-01-16.
  5. ↑ "CV" (PDF).
  6. ↑ "Peterhouse Fellows".
  7. ↑ Hansen, Anders C. (2011). "On the Solvability Complexity Index, the n-pseudospectrum and approximations of spectra of operators". Journal of the American Mathematical Society . 24: 81–124. doi: 10.1090/S0894-0347-2010-00676-5 .
  8. 1 2 Ben-Artzi, J.; Hansen, A. C.; Nevanlinna, O.; Seidel, M. (2015). "New barriers in complexity theory: On the solvability complexity index and the towers of algorithms". Comptes Rendus Mathematique . 535 (10): 931–936. doi: 10.1016/j.crma.2015.08.002 .
  9. ↑ Ben-Artzi, J.; Colbrook, M.; Hansen, A. C.; Nevanlinna, O.; Seidel, M. C. (2020). "Computing Spectra -- On the Solvability Complexity Index Hierarchy and Towers of Algorithms". arXiv: 1508.03280v5 [cs.CC].
  10. ↑ Bastounis, A.; Hansen, A. C.; Vlacic, V. (2021). "The extended Smale's 9th problem -- On computational barriers and paradoxes in estimation, regularisation, computer-assisted proofs and learning". arXiv: 2110.15734v1 [math.OC].
  11. ↑ Colbrook, Matthew J.; Antun, Vegard; Hansen, Anders C. (2022-03-16). "The difficulty of computing stable and accurate neural networks: On the barriers of deep learning and Smale's 18th problem". Proceedings of the National Academy of Sciences of the USA . 119 (12): e2107151119. Bibcode:2022PNAS..11907151C. doi:10.1073/pnas.2107151119. ISSN   0027-8424. PMC   8944871 . PMID   35294283.
  12. ↑ Smale, Steve (1985). "On the Efficiency of Algorithms in Analysis". Bulletin of the American Mathematical Society . 13 (2): 87–121. doi: 10.1090/S0273-0979-1985-15391-1 .
  13. ↑ McMullen, Curt (1987). "Families of rational maps and iterative root-finding algorithms". Annals of Mathematics . 125 (3): 467–493. doi:10.2307/1971408. JSTOR   1971408.
  14. 1 2 Doyle, Peter; McMullen, Curt (1989). "Solving the quintic by iteration". Acta Mathematica . 163: 151–180. doi: 10.1007/BF02392735 . S2CID   14827783.
  15. ↑ "Leverhulme Prize 2017 citations | Leverhulme Trust".
  16. ↑ "University of Cambridge Features: Faculty Insight".
  17. ↑ "Mathematics People |Hansen Awarded 2018 IMA Prize | Notices of the American Mathematical Society, Volume 66, Number 6" (PDF).
  18. ↑ "Anders Hansen Awarded the 2018 IMA Prize in Mathematics and its Applications | Institute for Mathematics and its Applications".
  19. ↑ "Whitehead Prize 2019 Citation for Dr Anders Hansen | London Mathematical Society" (PDF).
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.