SearcharxivSearch

arXiv subjects

Vladimir Danchenko

Publications and source records attributed to Vladimir Danchenko.

3 recordsLinked to original sources

Gorin's problem for individual simple partial fractions

The main result of the paper is a lower estimate for the moduli of imaginary parts of the poles of a simple partial fraction (i.e. the logarithmic derivative of an algebraic polynomial) under the condition that the $L^\infty(\mathbb{R})$-norm of the fraction is unit (Gorin's problem). In contrast to the preceding results, the estimate takes into account the residues associated with the poles. Moreover, a new estimate for the moduli is obtained in the case when the $L^\infty(\mathbb{R})$-norm of the derivative of the simple partial fraction is unit (Gelfond's problem).

math.CA

Quadrature formulas with variable nodes and Jackson-Nikolskii inequalities for rational functions

We obtain new parametric quadrature formulas with variable nodes for integrals of complex rational functions over circles, segments of the real axis and the real axis itself. Basing on these formulas we derive $(q,p)$-inequalities of Jackson-Nikolskii type for various classes of rational functions, complex polynomials and their logarithmic derivatives (simple partial fractions). It is shown that our $(\infty,2)$- and $(\infty,4)$-inequalities are sharp in a number of main theorems. Our inequalities extend and refine several results obtained earlier by other authors.

math.CA

Approximation by amplitude and frequency operators

We study Padé interpolation at the node $z=0$ of functions $f(z)=\sum_{m=0}^{\infty} f_m z^m$, analytic in a neighbourhood of this node, by amplitude and frequency operators (sums) of the form $$ \sum_{k=1}^n μ_k h(λ_k z), \qquad μ_k,λ_k\in \mathbb{C}. $$ Here $h(z)=\sum_{m=0}^{\infty} h_m z^m$, $h_m\ne 0$, is a fixed (basis) function, analytic at the origin, and the interpolation is carried out by an appropriate choice of amplitudes $μ_k $ and frequencies $λ_k$. The solvability of the $2n$-multiple interpolation problem is determined by the solvability of the associated moment problem $$ \sum_{k=1}^nμ_k λ_k^m={f_m}/{h_m}, \qquad m=\overline{0,2n-1}. $$ In a number of cases, when the moment problem is consistent, it can be solved by the classical method due to Prony and Sylvester, moreover, one can easily construct the corresponding interpolating sum too. In the case of inconsistent moment problems, we propose a regularization method, which consists in adding a special binomial $c_1z^{n-1}+c_2 z^{2n-1}$ to an amplitude and frequency sum so that the moment problem, associated with the sum obtained, can be already solved by the method of Prony and Sylvester. This approach enables us to obtain interpolation formulas with $n$ nodes $λ_k z$, being exact for the polynomials of degree $\le 2n-1$, whilst traditional formulas with the same number of nodes are usually exact only for the polynomials of degree $\le n-1$. The regularization method is applied to numerical differentiation and extrapolation.

math.CA