Conferences  >  Mathematics  >  Numerical Analysis and Computational Mathematics

CIRM - Jean-Morlet Chair

The theme of the conference will be explicit and computational methods in number theory and arithmetic geometry in a broad sense. The format will include scientific talks as well as time for informal collaboration and for coding projects related to (for example) PARI/GP, SageMath, Magma, OSCAR or the L-Functions and Modular Forms Database.

Centre International de Rencontres Mathématiques

The theme of the conference will be explicit and computational methods in number theory and arithmetic geometry in a broad sense. The format will include scientific talks as well as time for informal collaboration and for coding projects related to (for example) PARI/GP, SageMath, Magma, OSCAR or the L-Functions and Modular Forms Database. On the one hand, various topics where explicit computations have been the key for proving important results will be presented. These will be found in the context of modular forms, the study of rational points, as well as results towards the Birch and Swinnerton-Dyer conjecture. On the other hand, we will also focus on recently stated conjectures, for example the paramodular conjecture by Brumer and Kramer, and challenge participants to exhibit new examples to support such conjectures (in the case of the paramodular conjecture only one non trivial example is currently known). We expect that the colloquium will lead to the emergence of new ideas and methods at the interface of these different fields, to new results as well as to new projects and collaborations.

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

Computations with matrices, such as their multiplication, are fundamental operations that are executed on millions of devices, from smartphones to supercomputers, every day. But what is the minimum number of operations it takes to multiply two matrices? Surprisingly, the answer is currently unknown. The problem of determining the complexity, or the number of operations required to perform a certain computation, goes back to the very origins of computing. In the age of large-scale scientific computing, big data, and machine learning, understanding the complexity of computations is crucial for designing algorithms that are efficient in terms of both time and energy. There are two distinct research communities in computer science and mathematics working to answer these questions. Each community brings different perspectives and different approaches, but they rarely interact with each other to the detriment of both. To truly advance the state-of-the-art and tackle huge computational problems, cooperation and collaboration is needed. This workshop will bring together a diverse group of researchers in theoretical computer science and numerical analysis to shape the future of research on the complexity of matrix computations.

Banach Center & Polish Academy of Sciences – Institute of Mathematics

The main scope of the research group is: topological methods in estimating the minimal number of vertices which are necessary to triangulate a manifold or an action of finite group $G$ on a manifold. Another goal is the topological complexity and its computation and relation to the problem of minimal triangulation. We assume to complete two already started works in the form of publications and begin new join projects.

Geometry and Topology,    Applied Mathematics (in general)

The workshop will be hosted by the Collaborative Research Center SFB 1283.

The focus of the meeting will be on different aspects of nonlocal operators including regularity and numerical analysis of solutions to equations driven by fractional resp. nonlocal operators.

Calculus, Differential Equations and Integration,    Analysis

The 2023 annual meeting of the French CNRS research network MASCOT-NUM will be held in Le Croisic from April 3 to April 6, and will be organized by the Groupement d'Intérêt Scientifique UQ@Paris-Saclay.

The event is dedicated to the 60th birthday of Fabrice Gamboa, with a series of presentation centered around Fabrice's favorite research topics. The first full day of the conference (April 4) will be mainly devoted, as is tradition, to presentations and posters made by doctoral students. The next two days (April 5–6) will be dedicated to research talks given by invited speakers, and a two-part lecture (2 x 1h15) given by Pierre Chainais.

GdR MASCOT-NUM is a French Research Group dealing with stochastic methods for the analysis of numerical codes.

Probability and Statistics, Game Theory,    Computational Physics and Numerical Simulation

ICERM / Brown University

The aim of this workshop is to discuss many exciting recent developments on the computational side of discrete optimization. The workshop has three main themes. The first theme is that of commercial and academic/open-source solvers that have allowed the solution of very large-scale problems, and of recent developments in exact solvers that have allowed for proofs of results in logic, knot theory, and combinatorics. The second theme is the interaction between optimization and machine learning: these two areas complement each other in several ways. The third theme is quantum computing and unconventional computing architectures: quantum computing has been used to tackle combinatorial optimization problems, and quantum algorithms exist for other related optimization problems such as linear and semidefinite relaxations.

ICERM

This workshop will focus on the intersection of mathematics, statistics, machine learning, and computation, when viewed through the lens of optimal transport (OT). Mathematical topics will include low-dimensional models for OT, linearizations of OT, and the geometry of OT including gradient flows and gradient descent in the space of measures. Relevant statistical topics will include reliable and efficient estimation of OT plans in high dimensions, the role of regularization in computing OT distances and plans, with applications to robust statistics, uncertainty quantification, and overparameterized machine learning. Computation will be a recurring theme of the workshop, with emphasis on the development of fast algorithms and applications to computational biology, high energy physics, material science, spatio-temporal modeling, natural language processing, and image processing.

Program Staff;     Phone: [1-401-863-5030];     Email: programstaff@icerm.brown.edu

Scientific Computing and Data Science,    Probability and Statistics, Game Theory

Eurandom – Workshop Centre in the area of Stochastics (Eindhoven University of Technology)

The NASPDE workshop has been hosted approximately once a year since 2007. The aim of this three-day workshop is to gather leading researchers working on various aspects of numerical methods for stochastic PDEs and/or PDEs with uncertain input, as well as their applications in science and engineering. Topics to be covered range from the analysis and implementation of numerical schemes for PDEs with uncertainty to recent developments in sampling (Monte Carlo) strategies and Bayesian inverse problems, as well as real-world applications of differential equations with randomness.

Probability and Statistics, Game Theory,    Calculus, Differential Equations and Integration

Leibniz Universität Hannover

Analysis,    Calculus, Differential Equations and Integration

Society for Industrial and Applied Mathematics (SIAM)

Applied Mathematics (in general),    Algorithms and Data Structures

Design, analysis, and implementation of geometric algorithms and data structures; Computational complexity of geometric problems; Implementation and experimental evaluation of geometric algorithms and heuristics, including mathematical, numerical, and algebraic aspects; Discrete and combinatorial geometry; Computational topology, topological data analysis, and topological combinatorics; Applications of computational geometry in any field.

Graph Theory and Combinatorics,    Geometry and Topology

Sorbonne Université

The conference in Paris will be the ninth conference of the Society, following the meeting that gave birth to the idea of FoCM in Park City (1995), and 8 very successful meetings in Rio de Janeiro (1997), Oxford (1999), Minneapolis (2002), Santander (2005), Hong Kong (2008), Budapest (2011), Montevideo (2014) and Barcelona (2017). The conference in Vancouver planned for 2020 was cancelled due to the Covid-19 pandemic. Each of the previous conferences had several hundred participants from all branches of mathematics that impinge on computation in the broadest sense. FoCM conferences are usually organized as follows: mornings are devoted to plenary talks and afternoons to the workshops, which are run in parallel. The conference is divided in three periods of three days, and each workshop is held during one of these periods. The spirit of FoCM is that participants are encouraged to come to the whole duration of the conference, and attend talks in different workshops. Poster sessions are also organized by each workshop.

Email: info@focm2023.org

ICERM

In Summer 2023, ICERM hosts the second of two summer programs entitled The Social Justice and Data Science Summer Research Program. This program aims to increase interest, research training, and capacity for data science for social justice, and to develop both quantitative and qualitative approaches to those professional practices that call for community engagement, critical inquiry, and interdisciplinary cooperation. Building off of Summer 2022's program, which included a workshop on network science and analysis as well as foundational conversations with community partners, the Summer 2023 program will advance the mathematics community's understanding of the complexity of computational social justice work through three emphasis areas (1) policy, (2) education, and (3) community-driven research. As a new field emerges at the face of computational and applied mathematics and social justice, this requires new methods for working across community lines. In order to address the novel and interdisciplinary problems arising out of community needs, participants will work together to develop new or refine existing computational methods whose applications may be broader than the original problem. The organizers are committed to working with humility and in solidarity with one another and with the local community. The program will include engagement with the local community and invest in the education of the next generation of researchers by driving the development and direction of new computational methods for quantitative social justice research. Researchers with expertise and interests in using mathematical models and/or data science to examine social justice issues in policy and/or education are particularly encouraged to apply. The organizers also seek applications from researchers with specialties in digital humanities, computational social science, and data science education.

Program Staff;     Phone: [1-401-863-5030];     Email: programstaff@icerm.brown.edu

Scientific Computing and Data Science,    Applied Mathematics (in general)

Centre for Discrete Mathematics, UL PeF (University of Ljubljana, Faculty of Education)

ICERM

The mathematical and computational toolbox for modern experimental and engineering problems has become more diverse than ever before, with a flurry of new challenges in inverse problems and successful practical solutions that present further theoretical questions. In the spirit of the 2012 “Challenges in Geometry, Analysis, and Computation: High-Dimensional Synthesis” workshop at Yale, the “Modern Applied and Computational Analysis” workshop will be a celebration of different perspectives on inverse problems, models, inference, and harmonic analysis and a debate about the challenges and opportunities in the next decade of applied analysis. The topics include inverse problems, randomized linear algebra, machine learning in applied analysis, and tensor networks.

Program Staff;     Phone: [1-401-863-5030];     Email: info@icerm.brown.edu

National and Kapodistrian University of Athens (NKUA) and Littoral Côte d’Opale (ULCO) University in France.

The aim of this conference is to bring together researchers working in numerical analysis, scientific computation and applications. Participants will present and discuss their latest results in this area.

LMPA, ULCO, 50 rue F. Buisson, Calais France;     Phone: [0626622981];     Email: jbilou@univ-littoral.fr

Numerical and Multilinear Algebra, Maching Learning, Optimization, Numerical Methods and Analysis of PDEs, Approximation, Domain Decomposition methods, Inverse and Ill-posed problems for image processing, Computational Statistics.

Applied Mathematics (in general),    Scientific Computing and Data Science

ICERM

This will be a one-week conference broadly focused on the topics of the LMFDB, mathematical databases, computation, number theory, and arithmetic geometry. The conference will include invited talks, presentations by authors of papers submitted to the conference and selected by the scientific committee following peer-review, as well as time set aside for research and collaboration. This workshop is an activity of the Simons Collaboration 'Arithmetic Geometry, Number Theory, and Computation' and is supported by the Simons Foundation.

Program Staff;     Phone: [1-401-863-5030];     Email: info@icerm.brown.edu

Number Theory, Arithmetic,    Geometry and Topology

MIT, Cambridge, MA

This conference is in celebration of Alan Edelman's 60th birthday. Alan is well-known for his contributions across many fields in mathematics, computational science and computer science. In this conference, we are trying to cover the many areas of random matrix theory, numerical linear algebra, and scientific computing that have been enriched by Alan's contributions, which often bring into sharp focus how a nice computational "trick" often offers a nice theoretical insight, in reverse from the usual direction.

AMMCS-2023 is a major international forum and interdisciplinary conference focused on mathematical and computational sciences, with their applications to modeling natural, social, and engineering systems.

The conference provides a unique opportunity for in-depth technical discussions and exchange of ideas in all areas involving mathematical and computational sciences, modeling and simulation, as well as their applications in natural and social sciences, engineering and technology, industry and finance. It offers to researchers, industrialists, engineers and students to present their latest research, to interact with the experts in the field, and to foster interdisciplinary collaborations required to meet the challenges of modern science, technology, and society.

Institute for Advanced Study in Mathematics (IASM) in Hangzhou, China

Recursion theory measures the complexity of mathematical objects in terms of what is computable, in other words, what can be determined by a computer with no space or time limitations. We can define, for example, computable sets of natural numbers, computable (continuous) functions on the real numbers, or computably enumerable open subsets of the reals. Adding an oracle---an outside source of information---allows us to extend the reach of recursion theory beyond the computable. For example, every continuous function on the real numbers is a computable function relative to some oracle. For another example, a set of real numbers has Hausdorff dimension zero if and only if there is an oracle relative to which every real in the set can be significantly compressed. In this way, recursion theory offers a fine-grained way to analyze some of the most central notions in mathematics. This has recently led to deep applications to analysis, number theory, and set theory. The focus of this workshop is on understanding and extending these applications of recursion theory.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Analysis,    Calculus, Differential Equations and Integration