相关论文: Error Estimates of the Gain Approximation by Hermi…

Pansharpening is a widely used image enhancement technique for remote sensing. Its principle is to fuse the input high-resolution single-channel panchromatic (PAN) image and low-resolution multi-spectral image and to obtain a…

This work analyzes the overall computational complexity of the stochastic Galerkin finite element method (SGFEM) for approximating the solution of parameterized elliptic partial differential equations with both affine and non-affine random…

In this paper, we study the existence, regularity, and approximation of the solution for a class of nonlinear fractional differential equations. {In order to do this}, suitable variational formulations are defined for a nonlinear boundary…

We consider Galerkin finite element methods for semilinear stochastic partial differential equations (SPDEs) with multiplicative noise and Lipschitz continuous nonlinearities. We analyze the strong error of convergence for spatially…

In this paper, we develop an adaptive Generalized Multiscale Discontinuous Galerkin Method (GMs-DGM) for a class of high-contrast flow problems, and derive a-priori and a-posteriori error estimates for the method. Based on the a-posteriori…

Time-stepping $hp$-versions discontinuous Galerkin (DG) methods for the numerical solution of fractional subdiffusion problems of order $-\alpha$ with $-1<\alpha<0$ will be proposed and analyzed. Generic $hp$-version error estimates are…

The performance of a particle filter (PF) in nonlinear and non-Gaussian environments is often affected by particle degeneracy and impoverishment problems. In this paper, these two problems are re-assessed using the concepts of importance…

In this work, the fast-convolving reproducing kernel particle method (FC-RKPM) is introduced. This method is hundreds to millions of times faster than the traditional RKPM for 3D meshfree simulations. In this approach, the meshfree…

Recursive estimation of nonlinear dynamical systems is an important problem that arises in several engineering applications. Consistent and accurate propagation of uncertainties is important to ensuring good estimation performance. It is…

This work analyzes the stochastic approximation algorithm with non-decaying gains as applied in time-varying problems. The setting is to minimize a sequence of scalar-valued loss functions $f_k(\cdot)$ at sampling times $\tau_k$ or to…

The fluctuating Gunn-Peterson approximation (FGPA) is a commonly-used method to generate mock Lyman-$\alpha$ (Ly$\alpha$) forest absorption skewers at Cosmic Noon ($z\gtrsim 2$) from the matter-density field of $N$-body simulations without…

We use a concept of weak asymptotic solution for homogeneous as well as non-homogeneous fractional advection dispersion type equations. Using Legendre scaling functions as basis, a numerical method based on Galerkin approximation is…

In this paper, we derive a priori error estimates for a class of interior penalty discontinuous Galerkin (DG) methods using immersed finite element (IFE) functions for a classic second-order elliptic interface problem. The error estimation…

We introduce efficient $(1+\varepsilon)$-approximation algorithms for the binary matrix factorization (BMF) problem, where the inputs are a matrix $\mathbf{A}\in\{0,1\}^{n\times d}$, a rank parameter $k>0$, as well as an accuracy parameter…

Diffusion models have demonstrated strong generative capabilities across scientific domains, but often produce outputs that violate physical laws. We propose a new perspective by framing physics-informed generation as a sparse reward…

Feedback delay networks (FDNs) are recursive filters, which are widely used for artificial reverberation and decorrelation. One central challenge in the design of FDNs is the generation of sufficient echo density in the impulse response…

This article presents a superconvergence for the gradient approximation of the second order elliptic equation discretized by the weak Galerkin finite element methods on nonuniform rectangular partitions. The result shows a convergence of…

In supervised learning using kernel methods, we often encounter a large-scale finite-sum minimization over a reproducing kernel Hilbert space (RKHS). Large-scale finite-sum problems can be solved using efficient variants of Newton method,…

Weak Galerkin methods refer to general finite element methods for PDEs in which differential operators are approximated by their weak forms as distributions. Such weak forms give rise to desirable flexibilities in enforcing boundary and…

In this article, we present an $O(N \log N)$ rapidly convergent algorithm for the numerical approximation of the convolution integral with radially symmetric weakly singular kernels and compactly supported densities. To achieve the reduced…