اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultipoint Schur algorithm and orthogonal rational functions: convergence properties, I
81
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Classical Schur analysis is intimately connected to the theory of orthogonal polynomials on the circle [Simon, 2005]. We investigate here the connection between multipoint Schur analysis and orthogonal rational functions. Specifically, we study the convergence of the Wall rational functions via the development of a rational analogue to the SzegH o theory, in the case where the interpolation points may accumulate on the unit circle. This leads us to generalize results from [Khrushchev,2001], [Bultheel et al., 1999], and yields asymptotics of a novel type.
قيم البحث
اقرأ أيضاً
For rational functions, we use simple but elegant techniques to strengthen generalizations of certain results which extend some widely known polynomial inequalities of Erdos-Lax and Turan to rational functions R. In return these reinforced results, i
n the limiting case, lead to the corresponding refinements of the said polynomial inequalities. As an illustration and as an application of our results, we obtain some new improvements of the Erdos-Lax and Turan type inequalities for polynomials. These improved results take into account the size of the constant term and the leading coefficient of the given polynomial. As a further factor of consideration, during the course of this paper we shall demonstrate how some recently obtained results due to S. L. Wali and W. M. Shah, [Some applications of Dubinins lemma to rational functions with prescribed poles, J. Math.Anal.Appl.450 (2017) 769-779], could have been proved without invoking the results
We use nowdays classical theory of generalized moment problems by Krein-Nudelman [1977] to define a special class of stochastic Gaussian processes. The class contains, of course, stationary Gaussian processes. We obtain a spectral representation for
the processes from this class and we solve the corresponding prediction problem. The orthogonal rational functions on the unit circle lead to a class of Gaussian processes providing an example for the above construction.
The Cholesky factorization of the moment matrix is applied to discrete orthogonal polynomials on the homogeneous lattice. In particular, semiclassical discrete orthogonal polynomials, which are built in terms of a discrete Pearson equation, are studi
ed. The Laguerre-Freud structure semi-infinite matrix that models the shifts by $pm 1$ in the independent variable of the set of orthogonal polynomials is introduced. In the semiclassical case it is proven that this Laguerre-Freud matrix is banded. From the well known fact that moments of the semiclassical weights are logarithmic derivatives of generalized hypergeometric functions, it is shown how the contiguous relations for these hypergeometric functions translate as symmetries for the corresponding moment matrix. It is found that the 3D Nijhoff-Capel discrete Toda lattice describes the corresponding contiguous shifts for the squared norms of the orthogonal polynomials. The continuous Toda for these semiclassical discrete orthogonal polynomials is discussed and the compatibility equations are derived. It also shown that the Kadomtesev-Petvishvilii equation is connected to an adequate deformed semiclassical discrete weight, but in this case the deformation do not satisfy a Pearson equation.
We consider a wide class of linear boundary-value problems for systems of $r$-th order ordinary differential equations whose solutions range over the normed complex space $(C^{(n)})^m$ of $ngeq r$ times continuously differentiable functions $y:[a,b]t
omathbb{C}^{m}$. The boundary conditions for these problems are of the most general form $By=q$, where $B$ is an arbitrary continuous linear operator from $(C^{(n)})^{m}$ to $mathbb{C}^{rm}$. We prove that the solutions to the considered problems can be approximated in $(C^{(n)})^m$ by solutions to some multipoint boundary-value problems. The latter problems do not depend on the right-hand sides of the considered problem and are built explicitly.
We discuss the concept of inner function in reproducing kernel Hilbert spaces with an orthogonal basis of monomials and examine connections between inner functions and optimal polynomial approximants to $1/f$, where $f$ is a function in the space. We
revisit some classical examples from this perspective, and show how a construction of Shapiro and Shields can be modified to produce inner functions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
