Hausdorff Approximation of Functions Different from Zero at One Point - Implementation in Programming Environment Mathematica

ACM Computing Classification System (1998): G.1.2.

Principles of Extremum and Application to some Problems of Analysis

AMS subject classification: 41A17, 41A50, 49Kxx, 90C25.

Lagrangean Approximation for Combinatorial Inverse Problems

Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of techniques.

Fractional Korovkin Theory Based on Statistical Convergence

2000 Mathematics Subject Classification: 41A25, 41A36, 40G15.