Related papers: Approximation of integral operators using convolut…
In this article, we analyze the approximation properties of the new family of Durrmeyer type exponential sampling operators. We derive the point-wise and uniform approximation theorem and Voronovskaya type theorem for these generalized…
The convolution operator is the fundamental building block of modern convolutional neural networks (CNNs), owing to its simplicity, translational equivariance, and efficient implementation. However, its structure as a fixed, linear,…
This paper presents a modified general viscosity iterative process designed to solve variational inclusion and fixed point problems involving multi-valued quasi-nonexpansive and demi-contractive operators. The modified iterative process…
In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in…
Modeling non-stationary processes, where statistical properties vary across the input domain, is a critical challenge in machine learning; yet most scalable methods rely on a simplifying assumption of stationarity. This forces a difficult…
The combinatorial problem Max-Cut has become a benchmark in the evaluation of local search heuristics for both quantum and classical optimisers. In contrast to local search, which only provides average-case performance guarantees, the…
We study the capability of the Fast Fourier Transform (FFT) to accelerate exact and approximate matrix multiplication without using Strassen-like divide-and-conquer. We present a simple exact algorithm running in $O(n^{2.89})$ time, which…
The numerical evaluation of integrals of the form \begin{align*} \int_a^b f(x) e^{ikg(x)}\,dx \end{align*} is an important problem in scientific computing with significant applications in many branches of applied mathematics, science and…
Operator learning is a recent development in the simulation of Partial Differential Equations (PDEs) by means of neural networks. The idea behind this approach is to learn the behavior of an operator, such that the resulting neural network…
We provide operator-norm convergence estimates for solutions to a time-dependent equation of fractional elasticity in one spatial dimension, with rapidly oscillating coefficients that represent the material properties of a viscoelastic…
We present an extension of local sensitivity analysis, also referred to as the perturbation approach for uncertainty quantification, to Bayesian inverse problems. More precisely, we show how moments of random variables with respect to the…
Chromatic derivatives and series expansions of bandlimited functions have recently been introduced in signal processing and they have been shown to be useful in practical applications. We extend the notion of chromatic derivative using…
We propose a proximal approach to deal with a class of convex variational problems involving nonlinear constraints. A large family of constraints, proven to be effective in the solution of inverse problems, can be expressed as the lower…
In this article, we develop a new method to approximate numerically the fractional Laplacian of functions defined on $\mathbb R$, as well as some more general singular integrals. After mapping $\mathbb R$ into a finite interval, we…
In this paper we aim to generalize results obtained in the framework of fractional calculus by the way of reformulating them in terms of operator theory. In its own turn, the achieved generalization allows us to spread the obtained…
We consider linear and obstacle problems driven by a nonlocal integral operator, for which nonlocal interactions are restricted to a ball of finite radius. These type of operators are used to model anomalous diffusion and, for a special…
Proper splittings of operators are commonly used to study the convergence of iterative processes. In order to approximate solutions of operator equations, in this article we deal with proper splittings of closed range bounded linear…
We consider large linear and nonlinear fixed point problems, and solution with proximal algorithms. We show that there is a close connection between two seemingly different types of methods from distinct fields: 1) Proximal iterations for…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…