Related papers: An hp-Adaptive Sampling Algorithm on Dispersion Re…
This paper proposes two convergent adaptive mesh-refining algorithms for the hybrid high-order method in convex minimization problems with two-sided p-growth. Examples include the p-Laplacian, an optimal design problem in topology…
The inverse source problem for the Helmholtz equation poses significant challenges, particularly when sources exhibit complex or discontinuous geometries. Traditional numerical methods suffer from prohibitive computational costs, while…
In this paper, we deal with distributed estimation problems in diffusion networks with heterogeneous nodes, i.e., nodes that either implement different adaptive rules or differ in some other aspect such as the filter structure or length, or…
In this paper, we study an adaptive finite element method for multiple eigenvalue problems of a class of second order elliptic equations. By using some eigenspace approximation technology and its crucial property which is also presented in…
For a singularly perturbed elliptic model problem with two small parameters, we analyze finite element methods of any order on a Bakhvalov-type mesh. For convergence analysis, we construct a new interpolation by using the characteristics of…
Adaptive Finite Element Method (adaptivity) is known to be an effective numerical tool for some ill-posed problems. The key advantage of the adaptivity is the image improvement with local mesh refinements. A rigorous proof of this property…
In the feature maps of CNNs, there commonly exists considerable spatial redundancy that leads to much repetitive processing. Towards reducing this superfluous computation, we propose to compute features only at sparsely sampled locations,…
Based on the exact numerical simulation and physical analysis, we have demonstrated all-angle single-beam left-handed behavior and superlens for both transverse electric and transverse magnetic modes in a twodimensional coated photonic…
Hypercomplex signal processing (HSP) offers powerful tools for analyzing and processing multidimensional signals by explicitly exploiting inter-dimensional correlations through Clifford algebra. In recent years, hypercomplex formulations of…
Hypercomplex signal processing (HSP) provides state-of-the-art tools to handle multidimensional signals by harnessing intrinsic correlation of the signal dimensions through Clifford algebra. Recently, the hypercomplex representation of the…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…
In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid…
We devised a first order time stepping ensemble hybridizable discontinuous Galerkin (HDG) method for a group of parameterized convection diffusion PDEs with different initial conditions, body forces, boundary conditions and coefficients in…
We present a procedure to calculate 1/d corrections to the two-particle properties around the infinite dimensional dynamical mean field limit. Our method is based on a modified version of the scheme of Ref. onlinecite{SchillerIngersent}}.…
We introduce a new variational method for the numerical homogenization of divergence form elliptic, parabolic and hyperbolic equations with arbitrary rough ($L^\infty$) coefficients. Our method does not rely on concepts of ergodicity or…
We present an algorithm for solving the radiative transfer problem on massively parallel computers using adaptive mesh refinement and domain decomposition. The solver is based on the method of characteristics which requires an adaptive…
We present a new approach to the numerical upscaling for elliptic problems with rough diffusion coefficient at high contrast. It is based on the localizable orthogonal decomposition of $H^1$ into the image and the kernel of some novel…
We consider simultaneously identifying the membership and locations of point sources that are convolved with different low-pass point spread functions, from the observation of their superpositions. This problem arises in three-dimensional…
In the present work we introduce a complete set of algorithms to efficiently perform adaptive refinement and coarsening by exploiting truncated hierarchical B-splines (THB-splines) defined on suitably graded isogeometric meshes, that are…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…