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.
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.
In this paper, a new approach to the definition of the interpolating rational process of Fejer – Hermite with first-type Chebyshev – Markov nodes on a segment is studied and …
In this paper, a new approach to the definition of the interpolating rational process of Fejer – Hermite with first-type Chebyshev – Markov nodes on a segment is studied and some of its approximating properties are described. In the introduction a brief analysis of the results on the topic of the research is carried out. Herein, the methods of the construction of interpolating processes, in particular, Fejer – Hermite processes, in the polynomial and rational approximation are analysed. A new method to determine the interpolating rational Fejer – Hermite process is proposed. One of the main results of this paper is the proof of the uniform convergence of this process for an arbitrary function, which is continuous on the segment, under some restrictions for the poles of approximating functions. This result is preceded by some auxiliary statements describing the properties of special rational functions. The classic methods of mathematical analysis, approximation theory, and theory of functions of a complex variable are used to prove the results of the work. Moreover, we present the numerical analysis of the effectiveness of the application of the constructed interpolating Fejer – Hermite process for the approximation of a continuous function with singularities. The choice of parameters, on which the nodes of interpolation depend, is made in several standard ways. The obtained results can be applied to further study the approximating properties of interpolating processes.
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.
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.
In this paper, a new approach to the definition of the interpolating rational process of Fejer – Hermite with first-type Chebyshev – Markov nodes on a segment is studied and …
In this paper, a new approach to the definition of the interpolating rational process of Fejer – Hermite with first-type Chebyshev – Markov nodes on a segment is studied and some of its approximating properties are described. In the introduction a brief analysis of the results on the topic of the research is carried out. Herein, the methods of the construction of interpolating processes, in particular, Fejer – Hermite processes, in the polynomial and rational approximation are analysed. A new method to determine the interpolating rational Fejer – Hermite process is proposed. One of the main results of this paper is the proof of the uniform convergence of this process for an arbitrary function, which is continuous on the segment, under some restrictions for the poles of approximating functions. This result is preceded by some auxiliary statements describing the properties of special rational functions. The classic methods of mathematical analysis, approximation theory, and theory of functions of a complex variable are used to prove the results of the work. Moreover, we present the numerical analysis of the effectiveness of the application of the constructed interpolating Fejer – Hermite process for the approximation of a continuous function with singularities. The choice of parameters, on which the nodes of interpolation depend, is made in several standard ways. The obtained results can be applied to further study the approximating properties of interpolating processes.
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.
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.
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.
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
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.
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.
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.