Author Description

Login to generate an author description

Ask a Question About This Mathematician

The purpose of this paper is to construct an integral rational Fourier operator based on the system of Chebyshev – Markov rational functions and to study its approximation properties on … The purpose of this paper is to construct an integral rational Fourier operator based on the system of Chebyshev – Markov rational functions and to study its approximation properties on classes of Markov functions. In the introduction the main results of well-known works on approximations of Markov functions are present. Rational approximation of such functions is a well-known classical problem. It was studied by A. A. Gonchar, T. Ganelius, J.-E. Andersson, A. A. Pekarskii, G. Stahl and other authors. In the main part an integral operator of the Fourier – Chebyshev type with respect to the rational Chebyshev – Markov functions, which is a rational function of order no higher than n is introduced, and approximation of Markov functions is studied. If the measure satisfies the following conditions: suppμ = [1, a], a > 1, dμ(t) = ϕ(t)dt and ϕ(t) ἆ (t − 1)α on [1, a] the estimates of pointwise and uniform approximation and the asymptotic expression of the majorant of uniform approximation are established. In the case of a fixed number of geometrically distinct poles in the extended complex plane, values of optimal parameters that provide the highest rate of decreasing of this majorant are found, as well as asymptotically accurate estimates of the best uniform approximation by this method in the case of an even number of geometrically distinct poles of the approximating function. In the final part we present asymptotic estimates of approximation of some elementary functions, which can be presented by Markov functions.
Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of … Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of algebraic fractions in the case of a fixed number of geometrically different poles are investigated. An integral representation of approximations and an estimate of uniform approximations are found. Approximations of Markov functions in the case when the measure µ satisfies the conditions suppµ = [1, a], a > 1, dµ(t) = φ(t)dt and φ(t) ≍ (t − 1)α on [1, a], a are studied and estimates of pointwise and uniform approximations and the asymptotic expression of the majorant of uniform approximations are obtained. The optimal values of the parameters at which the majorant has the highest rate of decrease are found. As a corollary, asymptotic estimates of approximations on the segment [−1, 1] are given by the method of rational approximation of some elementary Markov functions under study.
We present a quasi-Hermite-Fejer-type interpolation with nodes in the zeroes of Chebychev–Markov sine fractions. The convergence of the considered interpolation process for any continuous function on [−1, 1] is proved … We present a quasi-Hermite-Fejer-type interpolation with nodes in the zeroes of Chebychev–Markov sine fractions. The convergence of the considered interpolation process for any continuous function on [−1, 1] is proved under the condition of the completeness of the corresponding system of rational functions. Next we construct Lobatto-type quadrature formula based on the quasi-Hermite-Fejer-type interpolation. We obtain coefficients of this quadrature in the explicit form. Also we derive convergence results for constructed quadrature formula.
Approximation properties of Fejer means of Fourier series by Chebyshev – Markov system of algebraic fractions and approximation by Fejer means of function |x|s, 0 < s < 2, on … Approximation properties of Fejer means of Fourier series by Chebyshev – Markov system of algebraic fractions and approximation by Fejer means of function |x|s, 0 < s < 2, on the interval [−1,1], are studied. One orthogonal system of Chebyshev – Markov algebraic fractions is considers, and Fejer means of the corresponding rational Fourier – Chebyshev series is introduce. The order of approximations of the sequence of Fejer means of continuous functions on a segment in terms of the continuity module and sufficient conditions on the parameter providing uniform convergence are established. A estimates of the pointwise and uniform approximation of the function |x|s, 0 < s < 2, on the interval [−1,1], the asymptotic expressions under n→∞ of majorant of uniform approximations, and the optimal value of the parameter, which provides the highest rate of approximation of the studied functions are sums of rational use of Fourier – Chebyshev are found.
Herein, the approximation properties of the Abel – Poisson means of rational conjugate Fourier series on the system of the Chebyshev–Markov algebraic fractions are studied, and the approximations of conjugate … Herein, the approximation properties of the Abel – Poisson means of rational conjugate Fourier series on the system of the Chebyshev–Markov algebraic fractions are studied, and the approximations of conjugate functions with density | x | s , s ∈(1, 2), on the segment [–1,1] by this method are investigated. In the introduction, the results related to the study of the polynomial and rational approximations of conjugate functions are presented. The conjugate Fourier series on one system of the Chebyshev – Markov algebraic fractions is constructed. In the main part of the article, the integral representation of the approximations of conjugate functions on the segment [–1,1] by the method under study is established, the asymptotically exact upper bounds of deviations of conjugate Abel – Poisson means on classes of conjugate functions when the function satisfies the Lipschitz condition on the segment [–1,1] are found, and the approximations of the conjugate Abel – Poisson means of conjugate functions with density | x | s , s ∈(1, 2), on the segment [–1,1] are studied. Estimates of the approximations are obtained, and the asymptotic expression of the majorant of the approximations in the final part is found. The optimal value of the parameter at which the greatest rate of decreasing the majorant is provided is found. As a consequence of the obtained results, the problem of approximating the conjugate function with density | x | s , s ∈(1, 2), by the Abel – Poisson means of conjugate polynomial series on the system of Chebyshev polynomials of the first kind is studied in detail. Estimates of the approximations are established, as well as the asymptotic expression of the majorants of the approximations. This work is of both theoretical and applied nature. It can be used when reading special courses at mathematical faculties and for solving specific problems of computational mathematics.
In this paper we propose a new approach to the construction of quadrature formulas of interpolation rational type on an interval. In the introduction, a brief analysis of the results … In this paper we propose a new approach to the construction of quadrature formulas of interpolation rational type on an interval. In the introduction, a brief analysis of the results on the topic of the research is carried out. Most attention is paid to the works of mathematicians of the Belarusian school on approximation theory – Gauss, Lobatto, and Radau quadrature formulas with nodes at the zeros of the rational Chebyshev – Markov fractions. Rational fractions on the segment, generalizing the classical orthogonal Jacobi polynomials with one weight, are defined, and some of their properties are described. One of the main results of this paper consists in constructing quadrature formulas with nodes at zeros of the introduced rational fractions, calculating their coefficients in an explicit form, and estimating the remainder. This result is preceded by some auxiliary statements describing the properties of special rational functions. Classical methods of mathematical analysis, approximation theory, and the theory of functions of a complex variable are used for proof. In the conclusion a numerical analysis of the efficiency of the constructed quadrature formulas is carried out. Meanwhile, the choice of the parameters on which the nodes of the quadrature formulas depend is made in several standard ways. The obtained results can be applied for further research of rational quadrature formulas, as well as in numerical analysis.
Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of … Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of algebraic fractions in the case of a fixed number of geometrically different poles are investigated. An integral representation of approximations and an estimate of uniform approximations are found. Approximations of Markov functions in the case when the measure µ satisfies the conditions suppµ = [1, a], a > 1, dµ(t) = φ(t)dt and φ(t) ≍ (t − 1)α on [1, a], a are studied and estimates of pointwise and uniform approximations and the asymptotic expression of the majorant of uniform approximations are obtained. The optimal values of the parameters at which the majorant has the highest rate of decrease are found. As a corollary, asymptotic estimates of approximations on the segment [−1, 1] are given by the method of rational approximation of some elementary Markov functions under study.
In this paper we propose a new approach to the construction of quadrature formulas of interpolation rational type on an interval. In the introduction, a brief analysis of the results … In this paper we propose a new approach to the construction of quadrature formulas of interpolation rational type on an interval. In the introduction, a brief analysis of the results on the topic of the research is carried out. Most attention is paid to the works of mathematicians of the Belarusian school on approximation theory – Gauss, Lobatto, and Radau quadrature formulas with nodes at the zeros of the rational Chebyshev – Markov fractions. Rational fractions on the segment, generalizing the classical orthogonal Jacobi polynomials with one weight, are defined, and some of their properties are described. One of the main results of this paper consists in constructing quadrature formulas with nodes at zeros of the introduced rational fractions, calculating their coefficients in an explicit form, and estimating the remainder. This result is preceded by some auxiliary statements describing the properties of special rational functions. Classical methods of mathematical analysis, approximation theory, and the theory of functions of a complex variable are used for proof. In the conclusion a numerical analysis of the efficiency of the constructed quadrature formulas is carried out. Meanwhile, the choice of the parameters on which the nodes of the quadrature formulas depend is made in several standard ways. The obtained results can be applied for further research of rational quadrature formulas, as well as in numerical analysis.
Herein, the approximation properties of the Abel – Poisson means of rational conjugate Fourier series on the system of the Chebyshev–Markov algebraic fractions are studied, and the approximations of conjugate … Herein, the approximation properties of the Abel – Poisson means of rational conjugate Fourier series on the system of the Chebyshev–Markov algebraic fractions are studied, and the approximations of conjugate functions with density | x | s , s ∈(1, 2), on the segment [–1,1] by this method are investigated. In the introduction, the results related to the study of the polynomial and rational approximations of conjugate functions are presented. The conjugate Fourier series on one system of the Chebyshev – Markov algebraic fractions is constructed. In the main part of the article, the integral representation of the approximations of conjugate functions on the segment [–1,1] by the method under study is established, the asymptotically exact upper bounds of deviations of conjugate Abel – Poisson means on classes of conjugate functions when the function satisfies the Lipschitz condition on the segment [–1,1] are found, and the approximations of the conjugate Abel – Poisson means of conjugate functions with density | x | s , s ∈(1, 2), on the segment [–1,1] are studied. Estimates of the approximations are obtained, and the asymptotic expression of the majorant of the approximations in the final part is found. The optimal value of the parameter at which the greatest rate of decreasing the majorant is provided is found. As a consequence of the obtained results, the problem of approximating the conjugate function with density | x | s , s ∈(1, 2), by the Abel – Poisson means of conjugate polynomial series on the system of Chebyshev polynomials of the first kind is studied in detail. Estimates of the approximations are established, as well as the asymptotic expression of the majorants of the approximations. This work is of both theoretical and applied nature. It can be used when reading special courses at mathematical faculties and for solving specific problems of computational mathematics.
The purpose of this paper is to construct an integral rational Fourier operator based on the system of Chebyshev – Markov rational functions and to study its approximation properties on … The purpose of this paper is to construct an integral rational Fourier operator based on the system of Chebyshev – Markov rational functions and to study its approximation properties on classes of Markov functions. In the introduction the main results of well-known works on approximations of Markov functions are present. Rational approximation of such functions is a well-known classical problem. It was studied by A. A. Gonchar, T. Ganelius, J.-E. Andersson, A. A. Pekarskii, G. Stahl and other authors. In the main part an integral operator of the Fourier – Chebyshev type with respect to the rational Chebyshev – Markov functions, which is a rational function of order no higher than n is introduced, and approximation of Markov functions is studied. If the measure satisfies the following conditions: suppμ = [1, a], a > 1, dμ(t) = ϕ(t)dt and ϕ(t) ἆ (t − 1)α on [1, a] the estimates of pointwise and uniform approximation and the asymptotic expression of the majorant of uniform approximation are established. In the case of a fixed number of geometrically distinct poles in the extended complex plane, values of optimal parameters that provide the highest rate of decreasing of this majorant are found, as well as asymptotically accurate estimates of the best uniform approximation by this method in the case of an even number of geometrically distinct poles of the approximating function. In the final part we present asymptotic estimates of approximation of some elementary functions, which can be presented by Markov functions.
Approximation properties of Fejer means of Fourier series by Chebyshev – Markov system of algebraic fractions and approximation by Fejer means of function |x|s, 0 < s < 2, on … Approximation properties of Fejer means of Fourier series by Chebyshev – Markov system of algebraic fractions and approximation by Fejer means of function |x|s, 0 < s < 2, on the interval [−1,1], are studied. One orthogonal system of Chebyshev – Markov algebraic fractions is considers, and Fejer means of the corresponding rational Fourier – Chebyshev series is introduce. The order of approximations of the sequence of Fejer means of continuous functions on a segment in terms of the continuity module and sufficient conditions on the parameter providing uniform convergence are established. A estimates of the pointwise and uniform approximation of the function |x|s, 0 < s < 2, on the interval [−1,1], the asymptotic expressions under n→∞ of majorant of uniform approximations, and the optimal value of the parameter, which provides the highest rate of approximation of the studied functions are sums of rational use of Fourier – Chebyshev are found.
We present a quasi-Hermite-Fejer-type interpolation with nodes in the zeroes of Chebychev–Markov sine fractions. The convergence of the considered interpolation process for any continuous function on [−1, 1] is proved … We present a quasi-Hermite-Fejer-type interpolation with nodes in the zeroes of Chebychev–Markov sine fractions. The convergence of the considered interpolation process for any continuous function on [−1, 1] is proved under the condition of the completeness of the corresponding system of rational functions. Next we construct Lobatto-type quadrature formula based on the quasi-Hermite-Fejer-type interpolation. We obtain coefficients of this quadrature in the explicit form. Also we derive convergence results for constructed quadrature formula.
The purpose of this paper is to construct an integral rational Fourier operator based on the system of Chebyshev – Markov rational functions and to study its approximation properties on … The purpose of this paper is to construct an integral rational Fourier operator based on the system of Chebyshev – Markov rational functions and to study its approximation properties on classes of Markov functions. In the introduction the main results of well-known works on approximations of Markov functions are present. Rational approximation of such functions is a well-known classical problem. It was studied by A. A. Gonchar, T. Ganelius, J.-E. Andersson, A. A. Pekarskii, G. Stahl and other authors. In the main part an integral operator of the Fourier – Chebyshev type with respect to the rational Chebyshev – Markov functions, which is a rational function of order no higher than n is introduced, and approximation of Markov functions is studied. If the measure satisfies the following conditions: suppμ = [1, a], a > 1, dμ(t) = ϕ(t)dt and ϕ(t) ἆ (t − 1)α on [1, a] the estimates of pointwise and uniform approximation and the asymptotic expression of the majorant of uniform approximation are established. In the case of a fixed number of geometrically distinct poles in the extended complex plane, values of optimal parameters that provide the highest rate of decreasing of this majorant are found, as well as asymptotically accurate estimates of the best uniform approximation by this method in the case of an even number of geometrically distinct poles of the approximating function. In the final part we present asymptotic estimates of approximation of some elementary functions, which can be presented by Markov functions.
2n--l--1)(2n--l~2)l!"'" (2n--2l + 2n--l--1)(2n--l~2)l!"'" (2n--2l +
Estimates are obtained for the rate of the approximation of functions continuous on the interval and permitting bounded analytic continuation into the circle by means of rational functions with a … Estimates are obtained for the rate of the approximation of functions continuous on the interval and permitting bounded analytic continuation into the circle by means of rational functions with a fixed number of geometrically different poles.Figures: 2. Bibliography: 7 items.
Let be a function of bounded variation, , and the Weyl kernel of order , i.e. , . Denote by and the classes of functions represented by the corresponding formulas … Let be a function of bounded variation, , and the Weyl kernel of order , i.e. , . Denote by and the classes of functions represented by the corresponding formulas The conjugate classes of functions and are also considered; they are convolutions of conjugate Weyl kernels with functions of bounded variation.The following main result is proved: where is the best uniform approximation by trigonometric rational functions of order at most , and is one of the classes Bibliography: 13 titles.
Previous article Next article Asymptotic Estimates and Entire Functions (M. A. Evgrafov; A. Shields, trans.)N. D. KazarinoffN. D. Kazarinoffhttps://doi.org/10.1137/1004079PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Asymptotic Estimates and Entire Functions (M. … Previous article Next article Asymptotic Estimates and Entire Functions (M. A. Evgrafov; A. Shields, trans.)N. D. KazarinoffN. D. Kazarinoffhttps://doi.org/10.1137/1004079PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Asymptotic Estimates and Entire Functions (M. A. Evgrafov; A. Shields, trans.)." SIAM Review, 4(3), pp. 270–271 Previous article Next article FiguresRelatedReferencesCited byDetails Volume 4, Issue 3| 1962SIAM Review History Published online:01 August 2006 InformationCopyright © 1962 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1004079Article page range:pp. 270-271ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics
In this paper we study polynomials that are orthogonal with respect to a weight function which is zero on a set of positive measure. These were initially introduced by Akhiezer … In this paper we study polynomials that are orthogonal with respect to a weight function which is zero on a set of positive measure. These were initially introduced by Akhiezer as a generalization of the Chebyshev polynomials where the interval of orthogonality is [-1,α]∪[β,1]. Here, this concept is extended and the interval is the union of g + 1 disjoint intervals, [-1,α1]∪j = 1g-1[βj,αj + 1]∪[βg,1], denoted by E. Starting from a suitably chosen weight function p, and the three-term recurrence relation satisfied by the polynomials, a hyperelliptic Riemann surface is defined, from which we construct representations for both the polynomials of the first (Pn) and second kind (Qn), respectively, in terms of the Riemann theta function of the surface. Explicit expressions for the recurrence coefficients an and bn are found in terms of theta functions. The second-order ordinary differential equation, where Pn and Qn/w (where w is the Stieltjes transform of the weight) are linearly independent solutions, is found. The simpler case, where g = 1, is extensively dealt with and the reduction to the Chebyshev polynomials in the limiting situation, α→β, where the two intervals merge into one, is demonstrated. We also show that p(x)kn(x,x)/n for xE, where kn(x,x) is the reproducing kernel at coincidence, tends to the equilibrium density of the set E, as n→∞.
Journal Article Christoffel–Darboux-type formulae for orthonormal rational functions with arbitrary complex poles Get access Karl Deckers Karl Deckers Laboratoire Painlevé UMR 8524 (ANO-EDP), UFR Mathématiques – M3, UST Lille, F-59655 … Journal Article Christoffel–Darboux-type formulae for orthonormal rational functions with arbitrary complex poles Get access Karl Deckers Karl Deckers Laboratoire Painlevé UMR 8524 (ANO-EDP), UFR Mathématiques – M3, UST Lille, F-59655 Villeneuve d’Ascq Cedex, France [email protected] Search for other works by this author on: Oxford Academic Google Scholar IMA Journal of Numerical Analysis, Volume 35, Issue 4, October 2015, Pages 1842–1863, https://doi.org/10.1093/imanum/dru049 Published: 06 November 2014 Article history Received: 10 January 2014 Revision received: 20 August 2014 Published: 06 November 2014
chier doit contenir la présente mention de copyright. chier doit contenir la présente mention de copyright.
We present a numerical procedure to approximate integrals of the form ∫ b a f ( x ) dx , where f is a function with singularities close to, but … We present a numerical procedure to approximate integrals of the form ∫ b a f ( x ) dx , where f is a function with singularities close to, but outside the interval [ a , b ], with − ∞ ⩽ a < b ⩽ +∞. The algorithm is based on rational interpolatory Fejér quadrature rules, together with a sequence of real and/or complex conjugate poles that are given in advance. Since for n fixed in advance, the accuracy of the computed nodes and weights in the n -point rational quadrature formula strongly depends on the given sequence of poles, we propose a small number of iterations over the number of points in the rational quadrature rule, limited by the value n (instead of fixing the number of points in advance) in order to obtain the best approximation among the first n . The proposed algorithm is implemented as a M atlab program.
A strong error estimate for the uniform rational approximation of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="x Superscript alpha"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>x</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>α<!-- α --></mml:mi> </mml:mrow> </mml:msup> </mml:mrow> … A strong error estimate for the uniform rational approximation of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="x Superscript alpha"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>x</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>α<!-- α --></mml:mi> </mml:mrow> </mml:msup> </mml:mrow> <mml:annotation encoding="application/x-tex">{x^{\alpha }}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> on [0, 1] is given, and its proof is sketched. Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper E Subscript n n Baseline left-parenthesis x Superscript alpha Baseline comma left-bracket 0 comma 1 right-bracket right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi>E</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>α<!-- α --></mml:mi> </mml:msup> </mml:mrow> <mml:mo>,</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">{E_{nn}}({x^\alpha },[0,1])</mml:annotation> </mml:semantics> </mml:math> </inline-formula> denote the minimal approximation error in the uniform norm. Then it is shown that <disp-formula content-type="math/mathml"> \[ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="limit Underscript x right-arrow normal infinity Endscripts e Superscript 2 pi StartRoot alpha n EndRoot Baseline upper E Subscript n n Baseline left-parenthesis x Superscript alpha Baseline comma left-bracket 0 comma 1 right-bracket right-parenthesis equals 4 Superscript 1 plus alpha Baseline StartAbsoluteValue sine pi alpha EndAbsoluteValue"> <mml:semantics> <mml:mrow> <mml:munder> <mml:mo form="prefix">lim</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>x</mml:mi> <mml:mo stretchy="false">→<!-- → --></mml:mo> <mml:mi mathvariant="normal">∞<!-- ∞ --></mml:mi> </mml:mrow> </mml:munder> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>e</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>2</mml:mn> <mml:mi>π<!-- π --></mml:mi> <mml:msqrt> <mml:mi>α<!-- α --></mml:mi> <mml:mi>n</mml:mi> </mml:msqrt> </mml:mrow> </mml:msup> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msub> <mml:mi>E</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>n</mml:mi> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mi>x</mml:mi> <mml:mi>α<!-- α --></mml:mi> </mml:msup> </mml:mrow> <mml:mo>,</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">)</mml:mo> <mml:mo>=</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:msup> <mml:mn>4</mml:mn> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>1</mml:mn> <mml:mo>+</mml:mo> <mml:mi>α<!-- α --></mml:mi> </mml:mrow> </mml:msup> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo stretchy="false">|</mml:mo> </mml:mrow> <mml:mi>sin</mml:mi> <mml:mo>⁡<!-- ⁡ --></mml:mo> <mml:mi>π<!-- π --></mml:mi> <mml:mi>α<!-- α --></mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo stretchy="false">|</mml:mo> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">\lim \limits _{x \to \infty } {e^{2\pi \sqrt {\alpha n} }}{E_{nn}}({x^\alpha },[0,1]) = {4^{1 + \alpha }}|\sin \pi \alpha |</mml:annotation> </mml:semantics> </mml:math> \] </disp-formula> holds true for each <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="alpha greater-than 0"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>α<!-- α --></mml:mi> <mml:mo>&gt;</mml:mo> <mml:mn>0</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">{\alpha &gt; 0}</mml:annotation> </mml:semantics> </mml:math> </inline-formula>.
Получена ассимптотическая формула для верхних граней уклонений сумм Фейера на Получена ассимптотическая формула для верхних граней уклонений сумм Фейера на
Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of … Approximations on the segment [−1, 1] of Markov functions by Abel – Poisson sums of a rational integral operator of Fourier type associated with the Chebyshev – Markov system of algebraic fractions in the case of a fixed number of geometrically different poles are investigated. An integral representation of approximations and an estimate of uniform approximations are found. Approximations of Markov functions in the case when the measure µ satisfies the conditions suppµ = [1, a], a &gt; 1, dµ(t) = φ(t)dt and φ(t) ≍ (t − 1)α on [1, a], a are studied and estimates of pointwise and uniform approximations and the asymptotic expression of the majorant of uniform approximations are obtained. The optimal values of the parameters at which the majorant has the highest rate of decrease are found. As a corollary, asymptotic estimates of approximations on the segment [−1, 1] are given by the method of rational approximation of some elementary Markov functions under study.
This book generalises the classical theory of orthogonal polynomials on the complex unit circle, or on the real line to orthogonal rational functions whose poles are among a prescribed set … This book generalises the classical theory of orthogonal polynomials on the complex unit circle, or on the real line to orthogonal rational functions whose poles are among a prescribed set of complex numbers. The first part treats the case where these poles are all outside the unit disk or in the lower half plane. Classical topics such as recurrence relations, numerical quadrature, interpolation properties, Favard theorems, convergence, asymptotics, and moment problems are generalised and treated in detail. The same topics are discussed for the different situation where the poles are located on the unit circle or on the extended real line. In the last chapter, several applications are mentioned including linear prediction, Pisarenko modelling, lossless inverse scattering, and network synthesis. This theory has many applications in theoretical real and complex analysis, approximation theory, numerical analysis, system theory, and in electrical engineering.