Congruence of analytic functions modulo a polynomial
This paper deals with the constructions of interpolation curves which pass through given supporting points (nodes) and touch supporting tangent vectors given at only some fo these points or, as the case may be, at all these points. The mathematical kernel of these constructions is based on Lienhard's interpolation method.
This paper deals with the constructions of interpolation curves which pass through given supporting points (nodes) and touch supporting tangent vectors given at only some of these points or, as the case may be, at all these points. The mathematical kernel of these constructions is based on the Lienhard's interpolation method. Formulae for the curvature of plane and space interpolation curves are derived.
In this article, we study the approximation of a probability measure on by its empirical measure interpreted as a random quantization. As error criterion we consider an averaged th moment Wasserstein metric. In the case where , we establish fine upper and lower bounds for the error, ahigh resolution formula. Moreover, we provide a universal estimate based on moments, a Pierce type estimate. In particular, we show that quantization by empirical measures is of optimal order under weak assumptions....
A new algorithm which generalizes the E-algorithm is presented. It is called the -algorithm. Some results on convergence acceleration for the -algorithm are proved. Some applications are given.
Iterative approximation algorithms are successfully applied in parametric approximation tasks. In particular, reduced basis methods make use of the so-called Greedy algorithm for approximating solution sets of parametrized partial differential equations. Recently, a priori convergence rate statements for this algorithm have been given (Buffa et al. 2009, Binev et al. 2010). The goal of the current study is the extension to time-dependent problems, which are typically approximated using the POD–Greedy...
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds on the accuracy with which intermediate calculations must be performed to correctly round these functions.
Soient une surface de l’espace euclidien et un ensemble de triangles euclidiens formant une approximation linéaire par morceaux de autour d’un point la courbure discrète ponctuelle au sommet de est, par définition, le quotient du défaut angulaire par la somme des aires des triangles ayant comme sommet. Un problème naturel est d’estimer la différence entre cette courbure discrète et la courbure lisse de en Nous présentons dans cet article des résultats obtenus dans [4], [5],...
Natural cubic interpolatory splines are known to have a minimal -norm of its second derivative on the (or class of interpolants. We consider cubic splines which minimize some other norms (or functionals) on the class of interpolatory cubic splines only. The cases of classical cubic splines with defect one (interpolation of function values) and of Hermite splines (interpolation of function values and first derivatives) with spline knots different from the points of interpolation are discussed....
Our primary goal in this preamble is to highlight the best of Vasil Popov’s mathematical achievements and ideas. V. Popov showed his extraordinary talent for mathematics in his early papers in the (typically Bulgarian) area of approximation in the Hausdorff metric. His results in this area are very well presented in the monograph of his advisor Bl. Sendov, “Hausdorff Approximation”.