Approximating the finite Hilbert transform via an Ostrowski type inequality for functions of bounded variation.
Approximating the MaxMin and MinMax Area Triangulations using Angular Constraints
* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005.We consider sets of points in the two-dimensional Euclidean plane. For a planar point set in general position, i.e. no three points collinear, a triangulation is a maximal set of non-intersecting straight line segments with vertices in the given points. These segments, called edges, subdivide the convex hull of the set into triangular regions called faces or simply triangles. We...
Approximation and/or construction of curves by minimization methods with or without constraints
Approximation by circular splines for solutions of ordinary differential equations
Approximation by Cubic C1-Splines on Arbitrary Triangulations.
Approximation by finite element functions using local regularization
Approximation by Hill functions. II.
Approximation de contours convexes par des splines paramétrées périodiques convexes , quadratiques ou cubiques
Approximation d'une fonction définie sur une sphère dans une base de fonctions sphériques de Legendre
Approximation in the space of planes: applications to geometric modeling and reverse engineering.
Se estudia la aproximación en el espacio de planos. Se introduce una medida de la distancia en este espacio, con la que pueden resolverse problemas de modelado con superficies desarrollables mediante algoritmos de aproximación de curvas. Además, el reconocimiento y reconstrucción de caras planas en nubes de puntos aparecen como un problema "clustering" en el espacio de planos. La aplicabilidad práctica de estos resultados se muestra en varios ejemplos.
Approximation, numerical differentiation and integration based on Taylor polynomial.
Approximation of discontinuous curves and surfaces by discrete splines with tangent conditions.
Approximation of elliptic integrals of the third kind for large values of argument and modulus
Approximation of the Stieltjes integral and applications in numerical integration
Some inequalities for the Stieltjes integral and applications in numerical integration are given. The Stieltjes integral is approximated by the product of the divided difference of the integrator and the Lebesgue integral of the integrand. Bounds on the approximation error are provided. Applications to the Fourier Sine and Cosine transforms on finite intervals are mentioned as well.
Approximation spline de surfaces de type explicite comportant des failles
Approximations and error bounds for computing the inverse mapping
In this paper we propose a procedure to construct approximations of the inverse of a class of differentiable mappings. First of all we determine in terms of the data a neighbourhood where the inverse mapping is well defined. Then it is proved that the theoretical inverse can be expressed in terms of the solution of a differential equation depending on parameters. Finally, using one-step matrix methods we construct approximate inverse mappings of a prescribed accuracy.
Approximations of the partial derivatives by averaging
A straightforward generalization of a classical method of averaging is presented and its essential characteristics are discussed. The method constructs high-order approximations of the l-th partial derivatives of smooth functions u in inner vertices a of conformal simplicial triangulations T of bounded polytopic domains in ℝd for arbitrary d ≥ 2. For any k ≥ l ≥ 1, it uses the interpolants of u in the polynomial Lagrange finite element spaces of degree k on the simplices with vertex a only. The...
Are the coefficients of a polynomial well-conditioned functions of its roots?
Asymptotic analysis of implicit tolerance problems.
Asymptotic Behavior of the Polynomial Factor in the Interpolation Error.