Page 1

Displaying 1 – 15 of 15

Showing per page

Constructive quantization: approximation by empirical measures

Steffen Dereich, Michael Scheutzow, Reik Schottstedt (2013)

Annales de l'I.H.P. Probabilités et statistiques

In this article, we study the approximation of a probability measure μ on d by its empirical measure μ ^ N interpreted as a random quantization. As error criterion we consider an averaged p th moment Wasserstein metric. In the case where 2 p l t ; d , we establish fine upper and lower bounds for the error, ahigh resolution formula. Moreover, we provide a universal estimate based on moments, a Pierce type estimate. In particular, we show that quantization by empirical measures is of optimal order under weak assumptions....

Convergence acceleration by the E + p -algorithm

A. Fdil (1998)

Applicationes Mathematicae

A new algorithm which generalizes the E-algorithm is presented. It is called the E + p -algorithm. Some results on convergence acceleration for the E + p -algorithm are proved. Some applications are given.

Curriculum vita of Prof. Vasil Atanasov Popov

Ivanov, Kamen, Petrushev, Pencho (2002)

Serdica Mathematical Journal

Our primary goal in this preamble is to highlight the best of Vasil Popov’s mathematical achievements and ideas. V. Popov showed his extraordinary talent for mathematics in his early papers in the (typically Bulgarian) area of approximation in the Hausdorff metric. His results in this area are very well presented in the monograph of his advisor Bl. Sendov, “Hausdorff Approximation”.

Currently displaying 1 – 15 of 15

Page 1