The conference on the Foundations of Computational Mathematics (FoCM 2017, http://www.ub.edu/focm2017/) took place in Barcelona between July 10th–19th, 2017.

It was organized by the Society for the Foundations of Computational Mathematics in partnership with the Local Organizing Committee with members from Universitat de  Barcelona (UB), Universitat Politècnica de Catalunya (UPC), Universitat Pompeu  Fabra (UPF) and ICREA, and administrative and logistic support from the UB Institut de Matemàtiques (IMUB) and the Centre de Recerca Matemàtica (CRM). The conference also received the institutional support of the Barcelona Graduate School of Mathematics (BGSMath).

This conference was the ninth in a sequence that started with the Park City meeting in 1995, organized by Steve Smale and where the idea of the FoCM Society was born, and followed by the FoCM conferences in Rio de Janeiro (1997), Oxford (1999), Minneapolis (2002), Santander (2005), Hong Kong (2008), Budapest (2011), and Montevideo (2014). Each of these conferences had several hundred participants from all branches of computational mathematics.

The conference took a format tried and tested to a great effect in the former FoCM conferences: plenary invited lectures in the mornings, and theme-centered parallel workshops in the afternoons. It consisted of three periods of three days each. Each workshop extended over a period. It included two semi-plenary lectures, of interest to a more general audience, as well as (typically shorter) talks aimed at a more technical audience. The choice of these speakers was the responsibility of the workshop organizers, and all of these workshop talks were by invitation. There were also contributed poster presentations associated to the workshops.

Although some participants chose to attend just one or two periods, on past experience the greatest benefit resulted from attending the conference for its full nine days: the entire idea of FoCM is that we strive to break out of narrow boundaries of our specific research areas and open our minds to the broad range of exciting developments in computational mathematics.

FoCM conferences currently appear to be a unique meeting point of workers in computational mathematics and of theoreticians in mathematics and in computer science. While presenting plenary talks by foremost world authorities and maintaining the highest technical level in the workshops, the emphasis is on multidisciplinary interaction across subjects and disciplines, in an informal and friendly atmosphere, giving the possibility to meet colleagues from different subject-areas and identify the wide-ranging (and often surprising) common denominator of research.

12videos
+ Follow and share
Follow and share this playlistTancar
Web playlist
RSS feed
Copy and paste the code into your website or blog to embed a playlist:Width:px
Generate code
Copy and paste the URL in your news reader to follow this Feed:Go to URL
Order
Filter
Format
Subject

Congressos i jornades: Foundations of Computational Mathematics 2017 (12)

Large Graph Limits of Learning Algorithms
Large Graph Limits of Learning Algorithms
mathematicsEnglish5 sep 2017503Many problems in machine learning require the classification of high dimensional data. One methodology to approach such problems is to construct a graph whose vertices are identified with data points, with edges weighted according to some measure of affinity between the data points. Algorithms such as spectral clustering, probit classification and the Bayesian level set method can all be ...
T < 4E
T < 4E
mathematicsEnglish5 sep 2017510Descartes proved that a graph embedding into the plane on V vertices and E edges ...
Variational Discretizations of Gauge Field Theories Using Group-Equivariant Interpolation Spaces
Variational Discretizations of Gauge Field Theories Using Group-Equivariant Interpolation Spaces
mathematicsEnglish5 sep 2017536Variational integrators are geometric structure-preserving numerical methods that preserve the symplectic structure, satisfy a discrete Noether's theorem, and exhibit exhibit excellent long-time energy stability properties. An exact discrete Lagrangian arises from Jacobi's solution of the Hamilton-Jacobi equation, and it generates the exact flow of a Lagrangian system. By approximating the ...
Dynamic Formulation of Optimal Transportation and Variational Relaxation of Euler Equations
Dynamic Formulation of Optimal Transportation and Variational Relaxation of Euler Equations
mathematicsEnglish5 sep 2017515We will briefly recall the classical Optimal Transportation Framework and its Dynamic relaxations. We will show the link between these Dynamic formulation and the so-called Multi-Marginal extension of Optimal Transportation. We will then describe the so-called Iterative Proportional Fitting Procedure (IPFP aka Sinkhorn method) which can be efficiently applied to the multi-marginal OT setting. ...
Adaptive High-Order Methods for Elliptic Problems: Convergence and Optimality
Adaptive High-Order Methods for Elliptic Problems: Convergence and Optimality
mathematicsEnglish5 sep 2017485Adaptive algorithms for h-type finite element discretizations of elliptic problems are by now well understood, as far as their convergence and optimality properties are concerned.The design and analysis of adaptive algorithms for hp-type discretizations poses new challenges. Indeed, the choice between applying a mesh refinement or a polynomial enrichment is a delicate stage in the ...
Linear Differential Equations as a Data-Structure
Linear Differential Equations as a Data-Structure
mathematicsEnglish5 sep 2017482Many informations concerning solutions of linear differential equations can be computed directly from the equation. It is therefore natural to consider these equations as a data-structure, from which mathematical properties can be computed. A variety of algorithms has thus been designed in recent years that do not aim at "solving'', but at computing with this representation. The talk will ...
Mathematics of Cell Division
Mathematics of Cell Division
mathematicsEnglish5 sep 2017522The problem of a mathematical structure for the biological process of cell differentiation will be addressed.Presentation by: Stephen Smale. UC, Berkeley, USA.
Information Complexity and Applications
Information Complexity and Applications
mathematicsEnglish5 sep 2017514Over the past two decades, information theory has reemerged within computational complexity theory as a mathematical tool for obtaining unconditional lower bounds in a number of models, including streaming algorithms, data structures, and communication complexity. Many of these applications can be systematized and extended via the study of information complexity – which treats information ...
Fourier-like Bases and Integrable Probability
Fourier-like Bases and Integrable Probability
mathematicsEnglish5 sep 2017527No information.Presentation by: Alexei Borodin. MIT, USA
Structure Tensors
Structure Tensors
mathematicsEnglish5 sep 2017503We show that in many instances, at the heart of a problem in numerical computation sits a special 3-tensor, the structure tensor of the problem that uniquely determines its underlying algebraic structure. For example, the Grothendieck constant, which plays an important role in unique games conjecture and SDP relaxations of NP-hard problems, arises as the spectral norm of such a structure ...
Completely Positive Semidefinite Matrices: Conic Approximations and Matrix Factorization Ranks
Completely Positive Semidefinite Matrices: Conic Approximations and Matrix Factorization Ranks
mathematicsEnglish5 sep 2017478The completely positive semidefinite cone is a new matrix cone, which consists of all the symmetric matrices (of a given size) that admit a Gram factorization by positive semidefinite matrices of any size. This cone can thus be seen as a non-commutative analogue of the classical completely positive cone, replacing factorizations by nonnegative vectors (aka diagonal psd matrices) by arbitrary ...
Microscopic Description of Systems of Points with Coulomb-type Interactions
Microscopic Description of Systems of Points with Coulomb-type Interactions
mathematicsEnglish5 sep 2017461We are interested in systems of points with Coulomb, logarithmic or Riesz interactions (i.e. inverse powers of the distance). They arise in various settings: an instance is the study of Fekete points in approximation theory, another is the classical log gas or Coulomb gas which in some cases happens to be a random matrix ensemble, another is vortices in superconductors, superfluids or ...
Pàgina