Related papers: A note on grid transfer operators for multigrid me…
We formulate and analyze a goal-oriented adaptive finite element method (GOAFEM) for a semilinear elliptic PDE and a linear goal functional. The strategy involves the finite element solution of a linearized dual problem, where the…
Let $F$ be a nonarchimedean local field of characteristic 0 with residual characteristic $p$ and let $\ell$ be an odd prime with $2\ell<p$. We establish and explicitly compute the local stable transfer factor $\Theta_\phi$ in the sense of…
Entity alignment (EA), a pivotal process in integrating multi-source Knowledge Graphs (KGs), seeks to identify equivalent entity pairs across these graphs. Most existing approaches regard EA as a graph representation learning task,…
We analyze a goal-oriented adaptive algorithm that aims to efficiently compute the quantity of interest $G(u^\star)$ with a linear goal functional $G$ and the solution $u^\star$ to a general second-order nonsymmetric linear elliptic partial…
A systematic analysis of matched layers is undertaken with special attention to better understand the remarkable method of B\'erenger. We prove that the B\'erenger and closely related layers define well posed transmission problems in great…
In this paper we consider the optimal control of semilinear fractional PDEs with both spectral and integral fractional diffusion operators of order $2s$ with $s \in (0,1)$. We first prove the boundedness of solutions to both semilinear…
In this paper, we construct a combined multiscale finite element method (MsFEM) using the Local Orthogonal Decomposition (LOD) technique to solve the multiscale problems which may have singularities in some special portions of the…
The construction of multigrid operators for disordered linear lattice operators, in particular the fermion matrix in lattice gauge theories, by means of algebraic multigrid and block LU decomposition is discussed. In this formalism, the…
We present a Boundary Local Fourier Analysis (BLFA) to optimize the relaxation parameters of boundary conditions in a multigrid framework. The method is implemented to solve elliptic equations on curved domains embedded in a uniform…
Algebraic multigrid (AMG) solvers and preconditioners are some of the fastest numerical methods to solve linear systems, particularly in a parallel environment, scaling to hundreds of thousands of cores. Most AMG methods and theory assume a…
The design of fast solvers for isogeometric analysis is receiving a lot of attention due to the challenge that offers to find an algorithm with a robust convergence with respect to the spline degree. Here, we analyze the application of…
A common pursuit in modern statistical learning is to attain satisfactory generalization out of the source data distribution (OOD). In theory, the challenge remains unsolved even under the canonical setting of covariate shift for the linear…
The multigrid algorithm is a multilevel approach to accelerate the numerical solution of discretized differential equations in physical problems involving long-range interactions. Multiresolution analysis of wavelet theory provides an…
We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to…
In this paper, we develop sixth-order hybrid finite difference methods (FDMs) for the elliptic interface problem $-\nabla \cdot( a\nabla u)=f$ in $\Omega\backslash \Gamma$, where $\Gamma$ is a smooth interface inside $\Omega$. The variable…
This work investigates an elliptic optimal control problem defined on uncertain domains and discretized by a fictitious domain finite element method and cut elements. Key ingredients of the study are to manage cases considering the usually…
We present and analyze a new finite element method for solving interface problems on a triangular grid. The method locally modifies a given triangulation such that the interfaces are accurately resolved and the maximal angle condition…
Time-parallel algorithms seek greater concurrency by decomposing the temporal domain of a Partial Differential Equation (PDE), providing possibilities for accelerating the computation of its solution. While parallelisation in time has…
In [1] we consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization, where we provide a condition which allows to decide whether a solution of the necessary first order conditions…
We develop a reduction multigrid based on approximate ideal restriction (AIR) for use with asymmetric linear systems. We use fixed-order GMRES polynomials to approximate $A_\textrm{ff}^{-1}$ and we use these polynomials to build grid…