Parallel algorithms for singular value decomposition (SVD) have risen to prominence as an indispensable tool in high-performance numerical linear algebra. They offer significant improvements in the ...

In this video, Peter Sanders from Karlsruhe Institute of Technology presents: Parallel Algorithms Reconsidered. Parallel algorithms have been a subject of intensive algorithmic research in the 1980s.

Recently, a research team from the Technical University of Munich in Germany developed a new algorithm called High Parallel ...

Researchers at Los Alamos National Lab have developed new software to distribute computation more efficiently and across increasing numbers of supercomputer processors. This new decomposition approach ...

Parallel tempering is a generic Markov chain Monte Carlo sampling method which allows good mixing with multimodal target distributions, where conventional Metropolis-Hastings algorithms often fail.

It is well known that traditional Markov chain Monte Carlo (MCMC) methods can fail to effectively explore the state space for multimodal problems. Parallel tempering is a well-established population ...

The aim of Cevotec’s (Munich, Germany) CAD-CAM software Artist Studio is to support engineers when designing fiber patch placement (FPP) laminates. Recently, the company worked with the Technical ...