2017
Том 69
№ 9

All Issues

Gilewicz J.

Articles: 5
Brief Communications (English)

Approximation of Smooth Functions by Weighted Means of N-Point Padé Approximants

Gilewicz J., Jedynak R.

↓ Abstract   |   Full text (.pdf)

Ukr. Mat. Zh. - 2013. - 65, № 10. - pp. 1410–1419

Let f be a function we wish to approximate on the interval [x 1 ,x N ] knowing p 1 > 1,p 2 , . . . ,p N coefficients of expansion of f at the points x 1 ,x 2 , . . . ,x N . We start by computing two neighboring N -point Padé approximants (NPAs) of f, namely f 1 = [m/n] and f 2 = [m − 1/n] of f. The second NPA is computed with the reduced amount of information by removing the last coefficient from the expansion of f at x 1 . We assume that f is sufficiently smooth, (e.g. convex-like function), and (this is essential) that f 1 and f 2 bound f in each interval]x i ,x i+1[ on the opposite sides (we call the existence of such two-sided approximants the two-sided estimates property of f ). Whether this is the case for a given function f is not necessarily known a priori, however, as illustrated by examples below it holds for many functions of practical interest. In this case, further steps become relatively simple. We select a known function s having the two-sided estimates property with values s(x i ) as close as possible to the values f(x i ). We than compute the approximants s 1 = [m/n] and s 2 = [m − 1/n] using the values at points x i and determine for all x the weight function α from the equation s = αs 1 + (1 − α)s 2 . Applying this weight to calculate the weighted mean αf 1 + (1 − α)f 2 we obtain significantly improved approximation of f.

Article (English)

General algorithm of computation of $c$-table and detection of valleys

Gilewicz J., Pindor M.

↓ Abstract   |   Full text (.pdf)

Ukr. Mat. Zh. - 2010. - 62, № 6. - pp. 762–772

We present a review of all interesting results concerning the c-table obtained by the authors for the last two decades. These results are not widely known because they were presented in publications of limited circulation. We discuss different computational aspects of software producing the $c$-tables in the presence of blocs and their evolution following the evolution of the computer environment: effects of the use of 32-bit arithmetic .≈8 digits), 64-bit arithmetic (double precision, ≈16 digits), and Bailey’s Fortran multiprecision package .32 or 64 digits), competition between the ascending and descending algorithms, relationship between the complexity of computation and precision, overflow and underflow problems, competition between different formulas allowing one to overcome the blocs in the $c$-table, practical simple criterion of detecting numerical zeros in the c-table allowing to identify the blocs, and automatic detection of valleys.

Article (English)

On the relation between measures defining the Stieltjes and the inverted Stieltjes functions

Gilewicz J., Pindor M.

↓ Abstract   |   Full text (.pdf)

Ukr. Mat. Zh. - 2010. - 62, № 3. - pp. 327–331

A compact formula is found for the measure of the inverted Stieltjes function expressed by the measure of the original Stieltjes function.

Brief Communications (Russian)

Negative result in pointwise 3-convex polynomial approximation

Bondarenko A. V., Gilewicz J.

↓ Abstract   |   Full text (.pdf)

Ukr. Mat. Zh. - 2009. - 61, № 4. - pp. 563-567

Let $Δ^3$ be the set of functions three times continuously differentiable on $[−1, 1]$ and such that $f'''(x) ≥ 0,\; x ∈ [−1, 1]$. We prove that, for any $n ∈ ℕ$ and $r ≥ 5$, there exists a function $f ∈ C^r [−1, 1] ⋂ Δ^3 [−1, 1]$ such that $∥f (r)∥_{C[−1, 1]} ≤ 1$ and, for an arbitrary algebraic polynomial $P ∈ Δ^3 [−1, 1]$, there exists $x$ such that $$|f(x)−P(x)| ≥ C \sqrt{n}ρ^r_n(x),$$ where $C > 0$ is a constant that depends only on $r, ρ_n(x) := \frac1{n^2} + \frac1n \sqrt{1−x^2}$.

Article (English)

Coconvex Pointwise Approximation

Dzyubenko H. A., Gilewicz J., Shevchuk I. A.

↓ Abstract   |   Full text (.pdf)

Ukr. Mat. Zh. - 2002. - 54, № 9. - pp. 1200-1212

Assume that a function fC[−1, 1] changes its convexity at a finite collection Y := {y 1, ... y s} of s points y i ∈ (−1, 1). For each n > N(Y), we construct an algebraic polynomial P n of degree ≤ n that is coconvex with f, i.e., it changes its convexity at the same points y i as f and $$\left| {f\left( x \right) - P_n \left( x \right)} \right| \leqslant c{\omega }_{2} \left( {f,\frac{{\sqrt {1 - x^2 } }}{n}} \right), x \in \left[ { - 1,1} \right],$$ where c is an absolute constant, ω2(f, t) is the second modulus of smoothness of f, and if s = 1, then N(Y) = 1. We also give some counterexamples showing that this estimate cannot be extended to the case of higher smoothness.