Related papers: Ritz-type projectors with boundary interpolation p…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
We study interpolation properties for Shavrukov's bimodal logic $\mathbf{GR}$ of usual and Rosser provability predicates. For this purpose, we introduce a new sublogic $\mathbf{GR}^\circ$ of $\mathbf{GR}$ and its relational semantics. Based…
Based on two point spline approximations of arbitrary order, a series of functions that define lower bounds for sin(x) and sin(x)/x, over the interval [0,Pi/2], with increasingly low relative errors and smaller relative errors than…
In this paper a fourth order asymptotically optimal error bound for a new cubic interpolating spline function, denoted by Q-spline, is derived for the case that only function values at given points are used but not any derivative…
We study the distribution of the height of the intersection between the projective line defined by the linear polynomial $x_{0}+x_{1}+x_{2}$ and its translate by a torsion point. We show that for a strict sequence of torsion points, the…
For the numerical solution of the American option valuation problem, we provide a script written in MATLAB implementing an explicit finite difference scheme. Our main contribute is the definition of a posteriori error estimator for the…
We consider approximation by functions with finite support and characterize its approximation spaces in terms of interpolation spaces and Lorentz spaces.
We propose Splinter, a new technique for proving properties of heap-manipulating programs that marries (1) a new separation logic-based analysis for heap reasoning with (2) an interpolation-based technique for refining heap-shape invariants…
In this paper, we build up a framework for sparse interpolation. We first investigate the theoretical limit of the number of unisolvent points for sparse interpolation under a general setting and try to answer some basic questions of this…
A comprehensive approach to Sobolev-type embeddings, involving arbitrary rearrangement- invariant norms on the entire Euclidean space R^n, is offered. In particular, the optimal target space in any such embedding is exhibited. Crucial in…
Existing and extremal property of periodic perfect spline, which interpolates given function in the mean were proved.
We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and…
We present an efficient subpixel refinement method usinga learning-based approach called Linear Predictors. Two key ideas are shown in this paper. Firstly, we present a novel technique, called Symbolic Linear Predictors, which makes the…
In this paper we analyse convergence of projected fixed-point iteration on a Riemannian manifold of matrices with fixed rank. As a retraction method we use `projector splitting scheme'. We prove that the projector splitting scheme converges…
Geometric predicates are a basic ingredient to implement a vast range of algorithms in computational geometry. Modern implementations employ floating point filtering techniques to combine efficiency and robustness, and state-of-the-art…
We derive the implicit equations for certain parametric surfaces in three-dimensional projective space termed tensor product surfaces. Our method computes the implicit equation for such a surface based on the knowledge of the syzygies of…
We firstly describe a maximal inequality for dual Sobolev spaces W^{-1,p}. This one corresponds to a "Sobolev version" of usual properties of the Hardy-Littlewood maximal operator in Lebesgue spaces. Even in the euclidean space, this one…
We design quasi-interpolation operators based on piecewise polynomial weight functions of degree less than or equal to $p$ that map into the space of continuous piecewise polynomials of degree less than or equal to $p+1$. We show that the…
We obtain a result concerning the stability under the interpolation with functional parameter method for the approximation spaces of Lorentz-Marcinkiewicz type and also for the approximation spaces generated by symmetric norming functions…