Related papers: Parallel algorithm for numerical solution of heat …
Parallel computing is a standard approach to achieving high-performance computing (HPC). Three commonly used methods to implement parallel computing include: 1) applying multithreading technology on single-core or multi-core CPUs; 2)…
Multiscale methods for second order elliptic equations based on non-overlapping domain decomposition schemes have great potential to take advantage of multi-core, state-of-the-art parallel computers. These methods typically involve solving…
The prosperous development of both hardware and algorithms for quantum computing (QC) potentially prompts a paradigm shift in scientific computing in various fields. As an increasingly active topic in QC, the variational quantum algorithm…
This paper introduces a parallel-in-time algorithm for efficient steady-state solution of the eddy current problem. Its main idea is based on the application of the well-known multi-harmonic (or harmonic balance) approach as the coarse…
This paper presents a very straightforward method to compute the transient thermal response to arbitrary power dissipation profiles in electronic devices with multiple heat sources. Using cubic spline interpolation of simulated or measured…
We study parallel particle-in-cell (PIC) methods for low-temperature plasmas (LTPs), which discretize kinetic formulations that capture the time evolution of the probability density function of particles as a function of position and…
This paper presents an efficient numerical algorithm for the simulation of pulse-width modulated power converters via parallelization in time domain. The method applies the multirate partial differential equation approach on the coarse grid…
A multiscale numerical solver called the seamless-domain method (SDM) is used in linear heat conduction analysis of nonperiodic simulated fields. The practical feasibility of the SDM has been verified for use with periodic fields but has…
In this paper we proposed two new quasi-boundary value methods for regularizing the ill-posed backward heat conduction problems. With a standard finite difference discretization in space and time, the obtained all-at-once nonsymmetric…
Pseudo-arclength continuation is a well-established method for generating a numerical curve approximating the solution of an underdetermined system of nonlinear equations. It is an inherently sequential predictor-corrector method in which…
In order to run Computational Fluid Dynamics (CFD) codes on large scale infrastructures, parallel computing has to be used because of the computational intensive nature of the problems. In this paper we investigate the ADAPT platform where…
For the parallel-in-time integration method Parareal, pipelining can be used to hide some of the cost of the serial correction step and improve its efficiency. The paper introduces a basic OpenMP implementation of pipelined Parareal and…
This paper proposes an efficient parallelised computation of field/circuit coupled systems co-simulated with the Waveform Relaxation (WR) technique. The main idea of the introduced approach lies in application of the parallel-in-time method…
A high-performance parallel algorithm is proposed for modeling the propagation of acoustic and elastic waves in inhomogeneous media. An initial boundary-value problem is replaced by a series of boundary-value problems for a constant…
We have developed an application and implemented parallel algorithms in order to provide a computational framework suitable for massively parallel supercomputers to study the unitary dynamics of quantum systems. We use renowned parallel…
There is increasing interest in using multicore processors to accelerate stream processing. For example, indexing sliding window content to enhance the performance of streaming queries is greatly improved by utilizing the computational…
Parallel algorithms for solving any image processing task is a highly demanded approach in the modern world. Cellular Automata (CA) are the most common and simple models of parallel computation. So, CA has been successfully used in the…
We study how parallelism can speed up quantum simulation. A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse structures, called uniform-structured Hamiltonians, including…
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a…
We investigate the parallel performance of Parallel Spectral Deferred corrections, a numerical approach that provides small-scale parallelism for the numerical solution of initial value problems. The scheme is applied to the shallow-water…