Darstellung und Entwicklung des Restgliedes der Gregoriyschen Quadraturformel mit Hilfe von Spline-Funktionen.
Data approximation using polyharmonic radial basis functions
The paper is concerned with the approximation and interpolation employing polyharmonic splines in multivariate problems. The properties of approximants and interpolants based on these radial basis functions are shown. The methods of such data fitting are applied in practice to treat the problems of, e.g., geographic information systems, signal processing, etc. A simple 1D computational example is presented.
Data compression with -approximations based on splines
The paper contains short description of -algorithm for the approximation of the function with two independent variables by the sum of products of one-dimensional functions. Some realizations of this algorithm based on the continuous and discrete splines are presented here. Few examples concerning with compression in the solving of approximation problems and colour image processing are described and discussed.
DCR2: An Improved Algorithm for l¶ Rational Approximation on Intervals.
Deferred Corrections Using Uncentered End Formulas.
Densité des hypothèses assurant la convergence de l'algorithme de Remes
Desarrollos asintóticos de funciones de Airy generalizadas.
Description of the numerical algorithm of multidimensional domains imaging.
Détermination du pas optimal dans le calcul des dérivées sur ordinateur
Determination of the best constant in an inequality of Hardy, Littlewood, and Pólya.
Development and Implementation of NURBS Models of Quadratic Curves and Surfaces
This article goes into the development of NURBS models of quadratic curves and surfaces. Curves and surfaces which could be represented by one general equation (one for the curves and one for the surfaces) are addressed. The research examines the curves: ellipse, parabola and hyperbola, the surfaces: ellipsoid, paraboloid, hyperboloid, double hyperboloid, hyperbolic paraboloid and cone, and the cylinders: elliptic, parabolic and hyperbolic. Many real objects which have to be modeled in 3D applications possess...
Die ableitungsfreien Fehlerabschätzungen von Interpolationsformeln
Die ableitungsfreien Fehlerabschätzungen von Quadraturformeln. II
Die ableitungsfreien Fehlerabschätzungen von Quadraturformeln. I
Die Idee der Lienhardschen Interpolationsmethode bei der Lösung eines Interpolationsproblems
Die Interpolation durch Bernoulli'sche Funktionen
Die Struktur der normalen rationalen Funktionen.
Difference operators from interpolating moving least squares and their deviation from optimality
We consider the classical Interpolating Moving Least Squares (IMLS) interpolant as defined by Lancaster and Šalkauskas [Math. Comp. 37 (1981) 141–158] and compute the first and second derivative of this interpolant at the nodes of a given grid with the help of a basic lemma on Shepard interpolants. We compare the difference formulae with those defining optimal finite difference methods and discuss their deviation from optimality.
Difference operators from interpolating moving least squares and their deviation from optimality
We consider the classical Interpolating Moving Least Squares (IMLS) interpolant as defined by Lancaster and Šalkauskas [Math. Comp.37 (1981) 141–158] and compute the first and second derivative of this interpolant at the nodes of a given grid with the help of a basic lemma on Shepard interpolants. We compare the difference formulae with those defining optimal finite difference methods and discuss their deviation from optimality.
Diffusion models and their accelerated solution in image and surface processing.