Related papers: Polynomial approximation from diffused data: uniso…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
In this contribution, we propose a detailed study of interpolation-based data-driven methods that are of relevance in the model reduction and also in the systems and control communities. The data are given by samples of the transfer…
This work considers a nonlinear inverse source problem in a coupled diffusion equation from the terminal observation. Theoretically, under some conditions on problem data, we build the uniqueness theorem for this inverse problem and show…
Problems involving approximation from scattered data where data is arranged quasi-uniformly have been treated by RBF methods for decades. Treating data with spatially varying density has not been investigated with the same intensity, and is…
This work investigates the stability of (discrete) empirical interpolation for nonlinear model reduction and state field approximation from measurements. Empirical interpolation derives approximations from a few samples (measurements) via…
A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike…
The study of interpolation nodes and their associated Lebesgue constants are central to numerical analysis, impacting the stability and accuracy of polynomial approximations. In this paper, we will explore the Morrow-Patterson points, a set…
We develop an interpolation-based framework for noisy linear systems with unknown system matrix with bounded norm (implying bounded growth or non-increasing energy), and bounded process noise energy. The proposed approach characterizes all…
In this paper, we present recent stability results with explicit and dimensionally sharp constants and optimal norms for the Sobolev inequality and for the Gaussian logarithmic Sobolev inequality obtained by the authors in [24]. The…
In this paper we study time semi-discrete approximations of a class of polynomially stable infinite dimensional systems modeling the damped vibrations. We prove that adding a suitable numerical viscosity term in the numerical scheme, one…
In this paper, we develop a framework for the discretization of a mixed formulation of quasi-reversibility solutions to ill-posed problems with respect to Poisson's equations. By carefully choosing test and trial spaces a formulation that…
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…
A fast and reliable algorithm for the optimal interpolation of scattered data on the torus by multivariate trigonometric polynomials is presented. The algorithm is based on a variant of the conjugate gradient method in combination with the…
Standard interpolation techniques are implicitly based on the assumption that the signal lies on a homogeneous domain. In this letter, the proposed interpolation method instead exploits prior information about domain inhomogeneity,…
In this paper, we study the polynomial stability of analytical solution and convergence of the semi-implicit Euler method for non-linear stochastic pantograph differential equations. Firstly, the sufficient conditions for solutions to grow…
Ill posed linear and nonlinear initial value problems may be stabilized, that it converted to to well posed initial value problems, by the addition of purely nonscalar linear dispersive terms. This is a stability analog of the Turing…
The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…
This article uses a combination of three ideas from simulation to establish a nearly optimal polynomial upper bound for the joint density of the stable process and its associated supremum at a fixed time on the entire support of the joint…
In a series of papers (Lombardi & Schneider 2001, 2002) we studied in detail the statistical properties of an interpolation technique widely used in astronomy. In particular, we considered the average interpolated map and its covariance…