Description

The solution of large-scale problems in Computational Science and Engineering relies on the availability of accurate, robust and efficient numerical algorithms and software that are able to exploit the power offered by modern computer architectures. Such algorithms and software provide building blocks for prototyping and developing novel applications, and for improving existing ones, by relieving the developers from details concerning numerical methods as well as their implementation in new computing environments. The sessions of this topic will provide a forum for the discussion of recent developments in the design and implementation of parallel and distributed numerical algorithms.
They include many different aspects, ranging from fundamental algorithmic concepts, to their efficient implementation on modern parallel architectures, such as multicore and multi-GPU systems, to their application in design and prototyping scientific simulation software, as well as to performance analysis. Areas of interest include (but are not limited to):

Focus

• Dense and sparse linear algebra
• Discrete algorithms in scientific computing
• Combinatorial scientific computing
• PDE solvers and domain decomposition
• ODE and DAE solvers
• Optimization
• Nonlinear systems
• Integral equations
• Transforms (wavelets, FFTs, ...)

Topic committee

Global chair
Julien Langou, University of Colorado Denver, USA

Local chair
Matthias Bolten, University of Wuppertal, Germany

Further members
Laura Grigori, INRIA, France
Marian Vajteršic, University of Salzburg, Austria