Algorithms for Computing Shape Preserving Spline Approximations to Data.
Algorithms for Evaluation of the Wright Function for the Real Arguments’ Values
2000 Math. Subject Classification: 33E12, 65D20, 33F05, 30E15The paper deals with analysis of several techniques and methods for the numerical evaluation of the Wright function. Even if the focus is mainly on the real arguments’ values, the methods introduced here can be used in the complex plane, too. The approaches presented in the paper include integral representations of the Wright function, its asymptotic expansions and summation of series. Because the Wright function depends on two parameters ...
Algorithms in Unnormalized Arithmetic. II. Unrestricted Polynomial Evaluation.
All Bézier curves are attractors of iterated function systems.
Almost curvature continuous fitting of B-spline surfaces.
Almost Hermitian trigonometric interpolation on three equidistant nodes.
Alternation for Best Spline Approximations
An algebraic addition-theorem for Weierstrass' elliptic function and nomograms
A dual transformation is discussed, by which a concurrent chart represented by one equation is transformed into an alignment chart or into a tangential contact chart. Using this transformation an alignment chart where three scales coincide and a tangential contact chart consisting of a family of circles, which represent the relation , are constructed. In this case, a form of the addition-theorem for Weierstrass’ function involving no derivative is used.
An algorithm based on rolling to generate smooth interpolating curves on ellipsoids
We present an algorithm to generate a smooth curve interpolating a set of data on an -dimensional ellipsoid, which is given in closed form. This is inspired by an algorithm based on a rolling and wrapping technique, described in [11] for data on a general manifold embedded in Euclidean space. Since the ellipsoid can be embedded in an Euclidean space, this algorithm can be implemented, at least theoretically. However, one of the basic steps of that algorithm consists in rolling the ellipsoid, over...
An algorithm for biparabolic spline
The paper deals with the computation of suitably chosen parameters of a biparabolic spline (ot the tensor product type) on a rectangular domain. Some possibilities of choosing such local parameters (concentrated, dispersed parameters) are discussed. The algorithms for computation of dispersed parameters (using the first derivative representation) and concentraced parameters (using the second derivative representation) are given. Both these algorithms repeatedly use the one-dimensional algorithms....
An Algorithm for Discrete Linear Lp Approximation.
An Algorithm for Gaussian Quadrature given Modified Moments.
An algorithm for Hermite-Birkhoff interpolation
An algorithm for QMC integration using low-discrepancy lattice sets
Many low-discrepancy sets are suitable for quasi-Monte Carlo integration. Skriganov showed that the intersections of suitable lattices with the unit cube have low discrepancy. We introduce an algorithm based on linear programming which scales any given lattice appropriately and computes its intersection with the unit cube. We compare the quality of numerical integration using these low-discrepancy lattice sets with approximations using other known (quasi-)Monte Carlo methods. The comparison is based...
An Algorithm for Rational Interpolation Similar to the qd-Algorithm.
An Algorithm for Segment Approximation.
An algorithm for the approximation by cubic splines
An algorithm for the computation of polynomial splines of odd degree
An Algorithm for the Computation of the Exponential Spline.
An Algorithmic Approach to Hermite-Birkhoff-Interpolation.