Related papers: A parallel space-time multigrid method for the edd…
In this paper, we consider the classical wave equation with time-dependent, spatially multiscale coefficients. We propose a fully discrete computational multiscale method in the spirit of the localized orthogonal decomposition in space with…
Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point…
This paper presents Space-Time MultiGrid (STMG) methods which are suitable for performing topology optimisation of transient heat conduction problems. The proposed methods use a pointwise smoother and uniform Cartesian space-time meshes.…
We present a new adaptive parallel algorithm for the challenging problem of multi-dimensional numerical integration on massively parallel architectures. Adaptive algorithms have demonstrated the best performance, but efficient many-core…
We describe a parallel solver for the discretized weakly singular space-time boundary integral equation of the spatially two-dimensional heat equation. The global space-time nature of the system matrices leads to improved parallel…
The present article investigates the convergence of a class of space-time discretization schemes for the Cauchy problem for linear parabolic stochastic partial differential equations (SPDEs) defined on the whole space. Sufficient conditions…
We present a one-equation subgrid scale model that evolves the turbulence energy corresponding to unresolved velocity fluctuations in large eddy simulations. The model is derived in the context of the Germano consistent decomposition of the…
In this paper, we study temporal splitting algorithms for multiscale problems. The exact fine-grid spatial problems typically require some reduction in degrees of freedom. Multiscale algorithms are designed to represent the fine-scale…
In the present paper we concentrate on an important issue in constructing a good multigrid solver: the choice of an efficient smoother. We will introduce all-at-once multigrid solvers for optimal control problems which show robust…
This work focuses on the development of efficient solvers for the pseudo-stress formulation of the unsteady Stokes problem, discretised by means of a discontinuous Galerkin method on polytopal grids (PolyDG). The introduction of the…
In parallel simulation, convergence and parallelism are often seen as inherently conflicting objectives. Improved parallelism typically entails lighter local computation and weaker coupling, which unavoidably slow the global convergence.…
We consider a finite element method for elliptic equation with heterogeneous and possibly high-contrast coefficients based on primal hybrid formulation. A space decomposition as in FETI and BDCC allows a sequential computations of the…
We propose a robust, adaptive coarse-grid correction scheme for matrix-free geometric multigrid targeting PDEs with strongly varying coefficients. The method combines uniform geometric coarsening of the underlying grid with heterogeneous…
A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad-Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching…
Large eddy approximation of turbulent flow is given a natural setting within the DSC framework of computational fluid dynamics. Periodic cellular coarse-graining prevents the nodal flow from piling up and preserves its large patterns. The…
Based on an idea in Hironaka's proof of resolution of singularities, we present an algorithmic smoothness test for algebraic varieties. The test is inherently parallel and does not involve the calculation of codimension-sized minors of the…
Simulating spatiotemporal turbulence with high fidelity remains a cornerstone challenge in computational fluid dynamics (CFD) due to its intricate multiscale nature and prohibitive computational demands. Traditional approaches typically…
Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers. In this paper, we utilize the emerging idea of "coded computation" to design a novel…
In this work, we propose an efficient and robust multigrid method for solving the time-fractional heat equation. Due to the nonlocal property of fractional differential operators, numerical methods usually generate systems of equations for…
We propose a simple domain decomposition method for $d$-dimensional elliptic PDEs which involves an overlapping decomposition into local subdomain problems and a global coarse problem. It relies on a space-filling curve to create equally…