Abstract
We show how to obtain linear combinations of polynomials in an orthogonal sequence $\{P_n\}_{n\geq 0}$, such as $Q_{n,k}(x)=\sum\limits_{i=0}^k a_{n,i}P_{n-i}(x)$, $a_{n,0}a_{n,k}\neq0$, that characterize quasi-orthogonal polynomials of order $k\le n-1$. The polynomials in the sequence $\{Q_{n,k}\}_{n\geq 0}$ are obtained from $P_{n}$, by making use of parameter shifts. We use an algorithmic approach to find these linear combinations for each family applicable and these equations are used to prove quasi-orthogonality of order $k$. We also determine the location of the extreme zeros of the quasi-orthogonal polynomials with respect to the end points of the interval of orthogonality of the sequence $\{P_n\}_{n\geq 0}$, where possible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Symmetry, Integrability and Geometry: Methods and Applications
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.