Related papers: An efficient unconditionally stable method for Dir…
A Dirichlet $k$-partition of a domain $U \subseteq \mathbb{R}^d$ is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace-Dirichlet eigenvalues is minimal. A discrete version of Dirichlet partitions has…
We present a new algorithm for numerical computation of large eigenvalues and associated eigenfunctions of the Dirichlet Laplacian in a smooth, star-shaped domain in $\mathbb{R}^d$, $d\ge 2$. Conventional boundary-based methods require a…
The purpose of this article is to approximately compute the eigenvalues of the symmetric Dirichlet Laplacian within an interval $(0,\Lambda)$. A novel domain decomposition Ritz method, partition of unity condensed pole interpolation method,…
Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulation is identified…
Domain decomposition methods are used for approximate solving boundary problems for partial differential equations on parallel computing systems. Specific features of unsteady problems are taken into account in the most complete way in…
We develop a fast divided-and-conquer indirect collocation method for the homogeneous Dirichlet boundary value problem of variable-order space-fractional diffusion equations. Due to the impact of the space-dependent variable order, the…
The aim of this paper is to present a first evaluation of a dynamic partition strategy associated to the recently proposed asynchronous distributed computation scheme based on the D-iteration approach. The D-iteration is a fluid diffusion…
The solution of partial differential equations (PDEs) on complex domains often presents a significant computational challenge by requiring the generation of fitted meshes. The Diffuse Domain Method (DDM) is an alternative which reformulates…
Numerical algorithms for solving problems of mathematical physics on modern parallel computers employ various domain decomposition techniques. Domain decomposition schemes are developed here to solve numerically initial/boundary value…
This paper establishes explicit solutions for fractional diffusion problems on bounded domains. It also gives stochastic solutions, in terms of Markov processes time-changed by an inverse stable subordinator whose index equals the order of…
This paper detailedly discusses the locally one-dimensional numerical methods for efficiently solving the three-dimensional fractional partial differential equations, including fractional advection diffusion equation and Riesz fractional…
We propose a method to reduce the computational effort to solve a partial differential equation on a given domain. The main idea is to split the domain of interest in two subdomains, and to use different approximation methods in each of the…
Problems with localized nonhomogeneous material properties present well-known challenges for numerical simulations. In particular, such problems may feature large differences in length scales, causing difficulties with meshing and…
A framework is developed for a robust and highly accurate numerical solution of the coupled Stokes-Darcy system in three dimensions. The domain decomposition method is based on a Dirichlet-Neumann type splitting of the interface conditions…
In this work we design a new domain decomposition method for the Euler equations in 2 dimensions. The basis is the equivalence via the Smith factorization with a third order scalar equation to whom we can apply an algorithm inspired from…
We explore an optimal partition problem on surfaces using a computational approach. The problem is to minimise the sum of the first Dirichlet Laplace--Beltrami operator eigenvalues over a given number of partitions of a surface. We consider…
In this work we develop a novel domain splitting strategy for the solution of partial differential equations. Focusing on a uniform discretization of the $d$-dimensional advection-diffusion equation, our proposal is a two-level algorithm…
We develop an unconditionally energy-stable tensor-product space-time discretization framework for the solution of a linear kinetic transport equation in one space dimension. The kinetic equation is a simplified model of radiative transfer…
In the context of non overlapping domain decomposition methods, several algebraic approximations of the Dirichlet-to-Neumann (DtN) map are proposed in [F. X. Roux, et. al. Algebraic approximation of Dirichlet- to-Neumann maps for the…
We advocate Laplacian K-modes for joint clustering and density mode finding, and propose a concave-convex relaxation of the problem, which yields a parallel algorithm that scales up to large datasets and high dimensions. We optimize a tight…