Penalized Least Squares Fitting

* Supported by the Army Research Office under grant DAAD-19-02-10059.

Spline Subdivision Schemes for Compact Sets. A Survey

Dedicated to the memory of our colleague Vasil Popov January 14, 1942 – May 31, 1990 * Partially supported by ISF-Center of Excellence, and by The Hermann Minkowski Center for Geometry at Tel Aviv University, Israel

Approximation of Univariate Set-Valued Functions - an Overview

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Approximation of Experimental Data by Bezier Curves

Very often the experimental data are the realization of the process, fully determined by some unknown function, being distorted by hindrances. Treatment and experimental data analysis are substantially facilitated, if these data to represent as analytical expression. The experimental data processing algorithm and the example of using this algorithm for spectrographic analysis of oncologic preparations of blood is represented in this article.

Quality of Service System Approximation in IP Networks

This paper is sponsored by the Ministry of Education and Research of the Republic of Bulgaria in the framework of project No 105 “Multimedia Packet Switching Networks Planning with Quality of Service and Traffic Management”.

Greedy Approximation with Regard to Bases and General Minimal Systems

*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003

Nearly Coconvex Approximation

* Part of this work was done while the second author was on a visit at Tel Aviv University in March 2001

Approximation Classes for Adaptive Methods

* This work has been supported by the Office of Naval Research Contract Nr. N0014-91-J1343, the Army Research Office Contract Nr. DAAD 19-02-1-0028, the National Science Foundation grants DMS-0221642 and DMS-0200665, the Deutsche Forschungsgemeinschaft grant SFB 401, the IHP Network “Breaking Complexity” funded by the European Commission and the Alexan- der von Humboldt Foundation.

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.

Numerical Approximation of a Fractional-In-Space Diffusion Equation, I

2000 Mathematics Subject Classification: 26A33 (primary), 35S15 (secondary)

Numerical Approximation of a Fractional-In-Space Diffusion Equation (II) – with Nonhomogeneous Boundary Conditions

2000 Mathematics Subject Classification: 26A33 (primary), 35S15

Approximation of Lipschitz Mappings

2000 Mathematics Subject Classification: 46B03

Best Approximation and Moduli of Smoothness

2010 Mathematics Subject Classification: 41A25, 41A10.

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

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

Exponential approximation in the norms and semi-norms

The deviations of some entire functions of exponential type from real-valued functions and their derivatives are estimated. As approximation metrics we use the Lp-norms and power variations on R. Theorems presented here correspond to the Ganelius and Popov results concerning the one-sided trigonometric approximation of periodic functions (see [4, 5 and 8]). Some related facts were announced in [2, 3, 6 and 7].