#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1997

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

To de ne spline subdivision schemes for general compact sets we use the representation of spline subdivision schemes in terms of repeated averages and replace the usual average convex combination by a binary averaging operation between two compact sets introduced in and termed here the metric average These schemes are shown to converge in the Hausdor metric… (More)

We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, “shape” refers to (finitely many changes of) monotonicity, convexity, or q-monotonicity of a function. It is rather well known that it is possible to approximate a function by algebraic… (More)

- Kirill Kopotun, Marian Neamtu, Bojan Popov
- Math. Comput.
- 2003

A new class of Godunov-type numerical methods (called here weakly nonoscillatory or WNO) for solving nonlinear scalar conservation laws in one space dimension is introduced. This new class generalizes the classical nonoscillatory schemes. In particular, it contains modified versions of MinMod and UNO. Under certain conditions, convergence and error… (More)

- Kirill Kopotun
- Math. Comput.
- 2007

Several results on equivalence of moduli of smoothness of univariate splines are obtained. For example, it is shown that, for any 1 ≤ k ≤ r+1, 0 ≤ m ≤ r − 1, and 1 ≤ p ≤ ∞, the inequality n−νωk−ν(s(ν), n−1)p ∼ ωk(s, n −1)p, 1 ≤ ν ≤ min{k,m + 1}, is satisfied, where s ∈ Cm[−1, 1] is a piecewise polynomial of degree ≤ r on a quasi-uniform (i.e., the ratio of… (More)

Estimating the degree of approximation in the uniform norm, of a convex function on a finite interval, by convex algebraic polynomials, has received wide attention over the last twenty years. However, while much progress has been made especially in recent years by, among others, the authors of this article, separately and jointly, there have been left some… (More)

- Kirill Kopotun, Alexei Shadrin
- SIAM J. Math. Analysis
- 2003

Let SN,r be the (nonlinear) space of free knot splines of degree r − 1 with at most N pieces in [a, b], and let M be the class of all k-monotone functions on (a, b), i.e., those functions f for which the kth divided difference [x0, . . . , xk]f is nonnegative for all choices of (k+1) distinct points x0, . . . , xk in (a, b). In this paper, we solve the… (More)

Let f ∈ C[−1, 1] change its convexity finitely many times in the interval, say s times, at Ys : −1 < y1 < · · · < ys < 1. We estimate the degree of approximation of f by polynomials of degree n, which change convexity exactly at the points Ys. We show that provided n is sufficiently large, depending on the location of the points Ys, the rate of… (More)

- K Kopotun, D Leviatan
- 1997

Let a function f 2 L p ?1; 1], 0 < p 1 have 1 r < 1 changes of monotonicity. For all suuciently large n, we construct algebraic polynomials p n of degree n which are comonotone with f, and such that kf ? p n k Lp?1; 1] C(r)! ' 2 (f; n ?1) p , where ! ' 2 (f; n ?1) p denotes the Ditzian-Totik second modulus of smoothness in L p metric.

Our main interest in this paper is approximation of a continuous function, on a finite interval, which changes convexity finitely many times by algebraic polynomials which are coconvex with it. This topic has received much attention in recent years, and the purpose of this paper is to give final answers to open questions concerning the validity of Jackson… (More)

- Kirill Kopotun
- Journal of Approximation Theory
- 2006