Related papers: A parallel fast multipole method for a space-time …
This paper addresses the problem of parallelizing computations to study non-linear dynamics in large networks of non-locally coupled oscillators using heterogeneous computing resources. The proposed approach can be applied to a variety of…
The athermal quasistatic deformation method provides an elegant solution to overcome the limitation of short time spans in molecular simulations. It provides overdamped conditions, allowing for the extraction of purely structural responses…
We introduce a numerical workflow to model and simulate transient close-contact melting processes based on the space-time finite element method. That is, we aim at computing the velocity at which a forced heat source melts through a…
The use of Euler-Lagrange methods on unstructured grids extends their application area to more versatile setups. However, the lack of a regular topology limits the scalability of distributed parallel methods, especially for routines that…
Parallel computing has turned out to be the enabling technology to solve complex physical systems. However, the transition from shared memory, vector computers to massively parallel, distributed memory systems and, recently, to hybrid…
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…
This work describes a new version of the Fast Multipole Method for summing pairwise particle interactions that arise from discretizing integral transforms and convolutions on the sphere. The kernel approximations use barycentric Lagrange…
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)…
An integro-differential equation of hyperbolic type, with mixed boundary conditions, is considered. A continuous space-time finite element method of degree one is formulated. A posteriori error representations based on space-time cells is…
In this paper, we present a new multibody physics simulation framework that utilizes the subsystem-based structure and the Alternating Direction Method of Multiplier (ADMM). The major challenge in simulating complex high degree of freedom…
In this study, a fast multipole method (FMM) is used to decrease the computational time of a fully-coupled poroelastic hydraulic fracture model with a controllable effect on its accuracy. The hydraulic fracture model is based on the…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
A novel parallel algorithm for matrix multiplication is presented. The hyper-systolic algorithm makes use of a one-dimensional processor abstraction. The procedure can be implemented on all types of parallel systems. It can handle…
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically.…
We show among other things how knowing Schauder or Sobolev-space estimates for the one-dimensional heat equation allows one to derive their multidimensional analogs for equations with coefficients depending only on time variable with the…
In this paper, we propose an efficient exponential integrator finite element method for solving a class of semilinear parabolic equations in rectangular domains. The proposed method first performs the spatial discretization of the model…
This paper proposes a parallel in time (called also time parareal) method to solve Volterra integral equations of the second kind. The parallel in time approach follows the same spirit as the domain decomposition that consists of breaking…
We present a parallel hierarchical solver for general sparse linear systems on distributed-memory machines. For large-scale problems, this fully algebraic algorithm is faster and more memory-efficient than sparse direct solvers because it…
We propose an efficient method for the numerical approximation of a general class of two dimensional semilinear parabolic problems on polygonal meshes. The proposed approach takes advantage of the properties of the serendipity version of…
Scheduling query execution plans is a particularly complex problem in shared-nothing parallel systems, where each site consists of a collection of local time-shared (e.g., CPU(s) or disk(s)) and space-shared (e.g., memory) resources and…