Konferenzen  >  Mathematik  >  Numerische Analysis

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

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

Max Planck Institute for the Physics of Complex Systems (MPI-PKS)

The general topic of the conference is the theory and application of discrete ​structures. Its goal is to highlight the most salient trends in the field, which has ​close links to diverse areas such as cryptography, computer science, large-scale ​networks and biology. Particular areas of interest include: graphs and digraphs, ​hypergraphs, matroids, ordered sets, designs, coding theory, enumeration, ​combinatorics of words, discrete optimization, discrete and computational ​geometry, lattice point enumeration, combinatorial algorithms, computational ​complexity, and applications of discrete and algorithmic mathematics, including ​(but not limited to) web graphs, computational biology, telecommunication ​networks, and information processing.

Angewandte Mathematik (allgem.),    Algorithmen und Datenstrukturen

The Computational Geometry Week (CG Week) is the premier international forum for advances in computational geometry and its many applications. CG Week combines a number of events, most notably the 41st International Symposium on Computational Geometry (SoCG 2025), the associated Media Exposition (CG:ME), workshops, the Young Researchers Forum (CG:YRF), and the CG Challenge (CG:SHOP).

Geometrie und Topologie,    Angewandte Mathematik (allgem.)

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

This Dagstuhl Seminar aims to connect stakeholders from all these fields: computational harmonic analysis, numerical linear algebra, computer algebra, nonlinear approximation theory, digital signal processing and their applications. We hope to bring about more cross-fertilization between the different and separately developed subdomains linked to the seminar theme.

Analysis,    Infinitesimalrechnung, Differentialgleichungen, Integralrechnung

Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)

A universal source of difficulty in the numerical solution of differential equations is stiffness, which may stem from multi-scale dynamics and means that straightforward explicit discretizations are very inefficient. Consequently, choosing how to deal with stiffness (usually through the selection of the time discretization method) is often the most impactful decision made while solving these problems; it can be the difference between complete intractability and rapid solution.

Society for Industrial and Applied Mathematics (siam)

Society for Industrial and Applied Mathematics (SIAM)

Angewandte Mathematik (allgem.),    Algorithmen und Datenstrukturen

The subject of nonlinear analysis is of interest in its own right, and it also serves to lay the foundations for different fields of pure and applied mathematics. Researchers across the world are actively involved in analysing and developing different theories of mathematics which are applicable to real-world problems. Through this conference, the recent progress and advances in the different fields of mathematical analysis will be shared. We try to bring fruitful research directions and collaborations in this field.

Analysis,    Infinitesimalrechnung, Differentialgleichungen, Integralrechnung

Ghent Analysis & PDE Center, Ghent University

The purpose of the conference is to provide an international forum to present and discuss the latest developments in computational and applied mathematics in various emerging engineering and mathematical fields.

Email: acomen2025@ugent.be

Applied and computational mathematics, Computational solid mechanics, Computational fluid mechanics, Computational material science, Computational electromagnetism, Computational natural sciences and biomechanics, Data driven and Artificial Intelligence applied to modelling, Fluid-structure interactions and coupled problems, High performance scientific computing, Inverse problems, Machine learning, New and emerging discretisation methods, Numerical analysis, Optimisation methods, Partial Differential Equations, Software for scientific computations, Simulation of manufacturing processes, Uncertainty quantification and stochastic modelling

Angewandte Mathematik (allgem.),    Simulation

The Romanian Society of Applied and Industrial Mathematics

CAIM series provide a forum for the review of the recent trends in applied and industrial mathematics either from a qualitative or from a numerical point of view. The conference has also sections for computer sciences and the theoretical branches of mathematics like algebra or geometry. A special section of the conference is dedicated to the mathematical teaching.

Tel.: [0744427589];     Email: conferences.caim@yahoo.com

Partial Differential Equations; Ordinary Differential Equations, Dynamical Systems; Mathematical Modeling in Engineering and Life Sciences; Real, Complex, Functional and Numerical Analysis; Probability Theory, Mathematical Statistics, Operations Research; Algebra, Logic, Geometry; Computer Science; Education

Angewandte Mathematik (allgem.),    Simulation

Institute for Computational and Experimental Research in Mathematics, Brown University, Providence, RI (ICERM)

This workshop encompasses three major aspects of computation within Representation Theory and Algebraic Combinatorics. One concerns the development of efficient algorithms to compute important quantities in order to understand and classify them better. Such problems include structure constants and representation theoretic multiplicities, mutation invariants in cluster algebras, computing dimensions of coinvariant rings, characters of finite-dimensional representations, coefficients of Kazhdan-Lusztig polynomials, web bases etc. This is closely related to understanding what optimality we could expect and in particular the computational complexity aspects of those problems. Their computational complexity class can also be used to understand the existence of combinatorial interpretations, in particular for major structure constants lacking positive formulas like Kronecker and plethysm coefficients. On the other hand, representation theory has seen important applications within computational complexity theory, in the context of Geometric Complexity Theory and Quantum Information Theory.