An approximation of tabulated function.
An error analysis for absolute and relative approximation.
An extension of A. Ostrowski's Theorem on the round-off stability of iterations.
An optimal sequential algorithm for the uniform approximation of convex functions on .
Application of splines for determining the velocity characteristic of a medium from a vertical seismic survey
A method for solving the inverse kinematic problem of determining the velocity characteristic of a medium from a vertical seismic survey, is proposed. It is based on the combined use of the eikonal equation and spline methods of approximation for multivariable functions. The problem is solved by assuming a horizontally stratified medium; no assumptions about the number of layers and their thickness are made. First, using the data of the first arrival times of the seismic signal from several shotpoints,...
Approximants de Padé-Hermite. 1ère partie: théorie.
Approximants de Padé-Hermite. 2ème partie: programmation.
Approximate Fekete points for weighted polynomial interpolation.
Approximating poles of complex rational functions.
Approximation by Hill functions. II.
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.
Best Constants Occuring with the Modulus of Continuity in the Error Estimate for Spline Interpolants of Odd Degree on Equidistant Grids.
Biquadratic spline smoothing mean values
Bounds for a Class of Linear Functionals with Applications to Hermite Interpolation.
Convergence Rates of the POD–Greedy Method
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...
DCR2: An Improved Algorithm for l¶ Rational Approximation on Intervals.
Die Struktur der normalen rationalen Funktionen.
Discrete, Linear Approximation Problems in Polyhedral Norms.
Edge-based a Posteriori Error Estimators for Generating Quasi-optimal Simplicial Meshes
We present a new method for generating a d-dimensional simplicial mesh that minimizes the Lp-norm, p > 0, of the interpolation error or its gradient. The method uses edge-based error estimates to build a tensor metric. We describe and analyze the basic steps of our method
Efficient Stable Ways to Calculate Continued Fraction Coefficients From some Series.