The best algebraic approximation in Hölder norm.
The best approximation of the sinc function by a polynomial of degree with the square norm.
The best L2-approximation by finite sums of functions with separable variables.
The best uniform quadratic approximation of circular arcs with high accuracy
In this article, the issue of the best uniform approximation of circular arcs with parametrically defined polynomial curves is considered. The best uniform approximation of degree 2 to a circular arc is given in explicit form. The approximation is constructed so that the error function is the Chebyshev polynomial of degree 4; the error function equioscillates five times; the approximation order is four. For θ = π/4 arcs (quarter of a circle), the uniform error is 5.5 × 10−3. The numerical examples...
The Boubaker polynomials expansion scheme BPES for solving a standard boundary value problem.
The case of equality in Landau's problem.
The Chebyshev Solution of Certain Matrix Equations.
The circle theorem and related theorems for Gauss-type quadrature rules.
The Convergence and Saturation of Iterations of Positive Linear Operators.
The Convergence Rates of Expansions in Jacobi Polynomials.
The convex interpolation of histogram by polynomial splines: The existence theorem
The degenerate B-splines as a basis in the space of algebraic polynomials
The Derivation of Cubic Splines with Obstacles by Methods of Optimization and Optimal Control.
The direct and converse inequalities for Jackson-type operators on spherical cap.
The discrete Fourier-Transform an Lp approximation of functions.
The distribution of extremal points for Kergin interpolations : real case
We show that a convex totally real compact set in admits an extremal array for Kergin interpolation if and only if it is a totally real ellipse. (An array is said to be extremal for when the corresponding sequence of Kergin interpolation polynomials converges uniformly (on ) to the interpolated function as soon as it is holomorphic on a neighborhood of .). Extremal arrays on these ellipses are characterized in terms of the distribution of the points and the rate of convergence is investigated....
The distribution of the break points by the approximation of a square root by means of a broken line
The e-Algorithm and Multivariate Pade-Approximants
The Error Norm of Gaussian Quadrature Formulae for Weight Functions of Bernstein-Szegö Type.
The error norm of Gauss-Lobatto quadrature formulae for weight functions of Bernstein-Szegö type.