Welcome to FoCM!  

The computer has profoundly changed the relationship between mathematics and computation.  Besides its invaluable role in numeric, symbolic, and experimental applications, computation is an important object of mathematical study in its own right and a fundamental theoretical tool. It is a source of new and exciting problems for mathematics.

Foundations of Computational Mathematics (FoCM) is an international nonprofit organization that supports and promotes research at the interface of mathematics and computation.  It fosters interaction among mathematics, computer science, and other areas of computational science through conferences, events and publications. FoCM traces its beginnings to the Park City AMS--SIAM seminar  in 1995 and its first conference has been held in Rio de Janeiro in 1997.

The FoCM journal, produced by Springer-Verlag, publishes highest-quality research articles treating various aspects of computational mathematics.

The FoCM conference, held every three years, covers the entire spectrum of mathematical computation. Specialized events are held from time to time, and focus on timely research topics. Membership in FoCM is free and available through this website.


Jiawang Nie wins the 2018 SIAM Activity Group on Linear Algebra Best Paper Prize

Jiawang Nie

for his paper, Generating Polynomials and Symmetric Tensor Decompositions, Foundations of Computational Mathematics 17(2): 423-465 (2017)

Jiawang Nie graduated in UC Berkeley under the supervision of Bernd Sturmfels and James Demmel in 2006. He is now on the faculty at UCSD (

For more information, see


The Le Monde published the best scientific pictures from the year 2017: Link


Among these, the computational realization of the Nash C^1 embedding theorem by Borrelli et al. published in the Journal of FoCM, July 10, 2017: Link

Le Monde also published a longer article about this result earlier in 2017 (in French): Link


The Catalan Math Society has set up a prize for papers on Dynamical Systems,
sponsored by Carles Simó:


The last edition of the prize was given to the authors of a paper published at the FoCM Journal:
Jordi-Lluís Figueras, Àlex Haro and Alejandro Luque, "Rigorous Computer Assisted Application of KAM Theory: A Modern Approach", Found Comput Math (2016).


Interview with Mireille Bousquet-Mélou

Mireille Bousquet Melou Photo

The European Mathematical Society Newsletter published an interview with Mireille Bousquet-Mélou, written by Juanjo Rué. The interview took place at the FoCM 2017 Conference at the Universitat de Barcelona.

Link to interview  


FoCM 2020 Conference Location: Vancouver, Canada


June 2020

Main local contact: Ben Adcock


Bernd Sturmfels to Receive 2018 George David Birkhoff Prize in Applied Mathematics

Bernd Sturmfels

Bernd Sturmfels, University of California, Berkeley, will receive the 2018 George David Birkhoff Prize in Applied Mathematics for his instrumental role in creating the field of applied algebraic geometry.

Bernd Sturmfels has made foundational contributions to combinatorics, algebraic geometry, and symbolic computation, and has introduced algebraic techniques to numerous areas of applied mathematics including bioinformatics, computer vision, optimization, and statistics. Like Birkhoff, the intellectual range of his work stretches from pure mathematics to the very applied, and demonstrates the unity of mathematics. In addition, he is an exceptional expositor, a wonderful teacher, and a dedicated mentor to young mathematicians.

Bernd is a founding member of the SIAM Activity Group on Algebraic Geometry, the editor in chief of the SIAM Journal on Applied Algebra and Geometry, and an active member of the FoCM Society.


Lek-Heng Lim wins SIAM'S Wilkinson Prize in Numerical Analysis and Scientific Computing

Lek-Heng Kim

The Prize was awarded at the 2017 SIAM Annual Meeting.
Lek-Heng Lim is also the recipient of the 2017 Smale Prize.



Pierre Lairez wins the SIAM Activity Group on Algebraic Geometry Early Career Prize

Pierre Lairez

Pierre Lairez wins the SIAM Activity Group on Algebraic Geometry Early Career Prize, in recognition of his paper A Deterministic Algorithm to Compute Approximate Roots of Polynomial Systems in Polynomial Average Time, which represents the final step in the resolution of Smale’s 17th problem.