Titlebook: Numerical Methods of Approximation Theory/Numerische Methoden der Approximationstheorie; Workshop on Numerica Lothar Collatz,Günther Meinar

向外

CANDY

Strong Unicity Constants in Chebyshev Approximation,hebyshev spaces. Results of this type were proved by several authors in the special case of Haar spaces and spline spaces. Strong unicity constants are used to obtain error estimations for approximations computed by Remez type algorithms.

緩解

發(fā)起

學(xué)術(shù)討論會(huì)

botany

catagen

Knot-Elimination; Reversal of the Oslo Algorithm,Given a spline function of any order, we consider the possibility of approximating it, to within an acceptable tolerance, by a spline function of the same order but with fewer knots, and of achieving this end through a finite algorithm.

PALMY

Fourier Methods in Practical Approximation,On the basis of the Carathéodory-Fejér method (in conjunction with some auxiliary tools) we obtain simple but good substitutes for the Zolotarev polynomials and certain generalizations. Thereby we give rather sharp error bounds for the approximations involved. Further we point out certain relations to summability theory.

micronutrients

Infusion

On a Gaussian Quadrature Formula for Entire Functions of Exponential Type,Given a system of n distinct points x., x.,..., x. let