Approximation by simple fractions
In this paper, a number of problems concerning the uniform approximation of complex-valued continuous functions \(f(z\)) on compact subsets of the complex plane by simple fractions of the form \(\Theta_n(z) =\sum_{j=1}^n1/(z-z_0)\) are considered. It is shown that the best approximation of a function \(f\) by the fractions \(\Theta_n\) is of the same order of vanishing as the best approximations by polynomials of degree \(\leq n\). Let \(f(z) = \sum_{\nu=0}^\infty\alpha_\nu(f)z^\nu\) be a function regular in the unit disk \(\Delta\) with \(|\alpha_\nu(f)|\leq M\), \(\nu\in\mathbb N\). Then the simple Padé fractions \(\Theta_n\) of the function \(F(z) = f(z)/(2M)\) uniformly converge to \(F\) on any disk \(\Delta_\lambda=\{z : |z|\leq\lambda < 1\}\) and \(\|F-\Theta_n\|_{\Delta_\lambda}\leq\frac{1+n}{1-\lambda}\lambda^n\). This estimate is sharp. Denote by \(\rho(\Theta_n, K)\) the Euclidean distance between the set \(\{z_j\}\) of the poles of \(\Theta_n\) and a set \(K\in\overline{\mathbb C}\). One particular statement about the lower bound for the distances \(\rho(\Theta_m, K)\) depending on \(\|f - \Theta_m\|_\Delta K\) is proved. Suppose that \(P\) is a polynomial of degree \(n\geq 1\), \(Q_{nk}\) is a polynomial of degree \(nk\geq 1\), and for certain \(\varepsilon\in (0,1)\) and \(a\in(0, k')\) the estimate \(\|P-\Theta_{nk}\|_\Delta\leq a^kk^{-k}\) holds on \(\Delta\). Then for sufficiently large \(k\) we have \(\rho(\Theta_{nk}, \partial\Delta)\geq C k\), where \(C\) depends only on \(a,\varepsilon, \|P\|\).
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance
- Sufficient condition for the best uniform approximation by simple partial fractions
- On approximation of the rational functions, whose integral is single-valued on C, by differences of simplest fractions
- Approximation properties of the most simple fractions
- Approximation by linear fractional transformations of simple partial fractions and their differences
- Extremal and approximative properties of simple partial fractions
- Criteria for the best approximation by simple partial fractions on semi-axis and axis
- Approximation properties of the most simple fractions
- Approximation by sums of the form \(\sigma_k\lambda_k h(\lambda_kz)\) in the disk
- Approximation to constant functions by electrostatic fields due to electrons and positrons
- Approximation by simple partial fractions and their generalizations
- Approximation by simple partial fractions: universal sets of poles
- Least deviation of logarithmic derivatives of algebraic polynomials from zero
- Algorithm for constructing simple partial fractions of the best approximation of constants
- Numerical analysis of the method of differentiation by means of real \(h\)-sums
- An example of non-uniqueness of a simple partial fraction of the best uniform approximation
- Approximation properties of sums of the form \(\Sigma _k \lambda _k h (\lambda _k z)\)
- Approximation by simple partial fractions with constraints on the poles. II
- On the rate of approximation in the unit disc of H^1-functions by logarithmic derivatives of polynomials with zeros on the boundary
- Approximation by the simplest fractions on the real axis
- scientific article; zbMATH DE number 4142101 (Why is no real title available?)
- Uniqueness of a simple partial fraction of best approximation
- Approximation by sums of shifts of a single function on the circle
- On approximation of the rational functions, whose integral is single-valued on C, by differences of simplest fractions
- A criterion for the solvability of the multiple interpolation problem by simple partial fractions
- Approximation by simple partial fractions in unbounded domains
- Greedy approximation by arbitrary sets
- A criterion for the best uniform approximation by simple partial fractions in terms of alternance. II
- Approximation by special differences of simplest fractions
- Mergelyan’s theorem with polynomials non-vanishing on unions of sets
- Approximating Rational Numbers by Fractions
- Approximation by sums of shifts and dilations of a single function and neural networks
- Rate of interpolation of analytic functions with regularly decreasing coefficients by simple partial fractions
- On a nontraditional method of approximation
- Best local approximation by simplest fractions
- Density of quantized approximations
- Estimates of the best approximation of polynomials by simple partial fractions
- Approximation by sums of shifts of the function \(\overline{z} / z\)
- Approximation by a ``capacitor
- On numerical approximation of differential polynomials
- Estimates of the distances to direct lines and rays from the poles of simplest fractions bounded in the norm of \(L_p\) on these sets
This page was built for publication: Approximation by simple fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809969)
