Abstract

Let u be a quasi-definite linear functional defined on the linear space of polynomials P with complex coefficients. For such a functional we can define a sequence of monic orthogonal polynomials (SMOP in short) (Pn)n∈N, which satisfies a three term recurrence relation. If we increase the indices of the recurrence relation by one unity, then we get the sequence of associated polynomials of the first kind as solution. These polynomials will be orthogonal with respect to a linear functional denoted by u(1). In the literature two special transformations of the functional u are studied, the canonical Christoffel transformation u˜=(x−c)u and the canonical Geronimus transformation uˆ=(x−c)−1u+Mδc, where c is a fixed complex number, M is a free complex parameter and δc is the linear functional defined on P as 〈δc,p(x)〉=p(c). For the Christoffel transformation with SMOP (P˜n)n∈N, we are interested in analyzing the relation between the linear functionals u(1) and u˜(1). The super index denotes the linear functionals associated with the orthogonal polynomial sequences of the first kind (Pn(1))n∈N and (P˜n(1))n∈N, respectively. This problem is also studied for Geronimus transformations. Here we give close relations between their corresponding monic Jacobi matrices by using the LU and UL factorizations. To get this result, we first need to study the relation between u−1 (the inverse functional) and u(1) which can be given from a quadratic Geronimus transformation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.