Abstract
Let \(\displaystyle \{x_{k,n-1}\}_{k=1}^{n-1}\) and \(\displaystyle \{x_{k,n}\}_{k=1}^{n},\)\(n \in \mathbb {N}\), be two sets of real, distinct points satisfying the interlacing property \( x_{i,n}<x_{i,n-1}< x_{i+1,n}, i = 1,2,\dots ,n-1\). In [15], Wendroff proved that if \(p_{n-1}(x) = \displaystyle \prod \limits _{k=1}^{n-1} (x-x_{k,n-1})\) and \(p_{n}(x) = \displaystyle \prod \limits _{k=1}^{n} (x-x_{k,n})\), then pn− 1 and pn can be embedded in a non-unique monic orthogonal sequence \(\{p_{n}\}_{n=0}^{\infty }. \) We investigate a question raised by Mourad Ismail as to the nature and properties of orthogonal sequences generated by applying Wendroff’s Theorem to the interlacing zeros of \(C_{n-1}^{\lambda }(x)\) and \( (x^{2}-1) C_{n-2}^{\lambda }(x)\), where \(\{C_{k}^{\lambda }(x)\}_{k=0}^{\infty }\) is a sequence of monic ultraspherical polynomials and − 3/2 < λ < − 1/2, λ≠ − 1. We construct an algorithm for generating infinite monic orthogonal sequences \(\{D_{k}^{\lambda }(x)\}_{k=0}^{\infty }\) from the two polynomials \(D_{n}^{\lambda } (x): = (x^{2}-1) C_{n-2}^{\lambda } (x)\) and \(D_{n-1}^{\lambda } (x): = C_{n-1}^{\lambda } (x)\), which is applicable for each pair of fixed parameters n, λ in the ranges \(n \in \mathbb {N}, n \geq 5\) and λ > − 3/2, λ≠ − 1,0,(2k − 1)/2, k = 0,1,…. We plot and compare the zeros of \(D_{m}^{\lambda } (x)\) and \(C_{m}^{\lambda } (x)\) for selected choices of \(m \in \mathbb {N}\) and a range of values of the parameters λ and n. For − 3/2 < λ < − 1, the curves that the zeros of \(D_{m}^{\lambda } (x)\) and \(C_{m}^{\lambda } (x)\) approach are substantially different for large values of m. In contrast, when − 1 < λ < − 1/2, the two curves have a similar shape while the curves are almost identical for λ > − 1/2.
Similar content being viewed by others
References
Beardon, A., Driver, K., Jordaan, K.: Zeros of polynomials embedded in an orthogonal sequence. Numer. Algor. 48(3), 399–403 (2011)
Bihun, O.: Solvable dynamical systems and isospectral matrices defined in terms of the zeros of orthogonal or otherwise special polynomials. In: Euler, N. (ed.) Nonlinear Systems and Their Remarkable Mathematical Structures. CRC Press, Boca Raton (2018)
Brezinski, C., Driver, K.A., Redivo-Zaglia, M.: Quasi-orthogonality with applications to some families of classical orthogonal polynomials. Appl. Numer. Math. 48, 157–168 (2004)
Brezinski, C., Driver, K.A., Redivo-Zaglia, M.: Zeros of quadratic quasi-orthogonal order 2 polynomials. Appl. Numer. Math. 139, 143–145 (2019)
Bultheel, A., Cruz-Barroso, R., van Barel, M.: On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line. Calcolo 47, 21–48 (2010)
Driver, K., Duren, P.: Zeros of ultraspherical polynomials and the Hilbert-Klein formulas. J. Comp. Appl. Math. 135, 293–301 (2001)
Driver, K., Muldoon, M.E.: Zeros of quasi-orthogonal ultraspherical polynomials. Indag. Math. 27(4), 930–944 (2016)
Driver, K., Muldoon, M.E.: Bounds for extreme zeros of quasi-orthogonal ultraspherical polynomials. J. Class. Anal. 9, 69–78 (2016)
Koekoek, R., Lesky, P.A., Swarttouw, R.F.: Hypergeometric Orthogonal Polynomials and Their q-Analogues. Springer Monographs in Mathematics (2010)
Locher, F.: Stability test for linear difference forms. Numerical Integration IV (Oberwolfach, 1992). Internat. Ser. Numer. Math, vol. 112, pp. 215–223 (1993)
Lubinsky, D.S.: Quadrature identities for interlacing and orthogonal polynomials. Proc. A. M. S. 144, 4819–4829 (2016)
Mastroianni, G, Occorsio, D: Optimal systems of nodes for Lagrange Interpolation on bounded intervals, A survey. J. Comput. Appl. Math. 134, 325–341 (2001)
Simon, B.: Orthogonal Polynomials on the Unit Circle, Part 1, Classical Theory. American Math. Soc., Providence (2005)
Szegő, G.: Orthogonal Polynomials, American Mathematical Society Colloquium Publications, vol. 23, 4th edn (1975)
Wendroff, B.: On orthogonal polynomials. Proc. Amer. Math. Soc. 12, 554–555 (1961)
Acknowledgements
Kathy Driver would like to express her thanks to the Mathematics Department, University of Colorado, Colorado Springs, for its hospitality during her visit in Spring 2018, during which the work on this paper began.
Funding
Research of Kathy Driver is supported by the National Research Foundation of South Africa under grant number 115232.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix 1. Mathematica script for construction of an orthogonal sequence \(\{D_j^{\lambda }\}_{j=0}^{N+K-2}\), N ≥ 5, K ≥ 3
(* Mathematica script to construct the orthogonal sequence {D_j^\ \[Lambda]}, where 0\[LessEqual]j\[LessEqual]NN+KK-2, from the \ starting polynomials D_NN^\[Lambda](x)=(x^2-1) C_(NN-2)^\[Lambda](x) \ and D_(NN-1)^\[Lambda]=C_(NN-1)^\[Lambda](x) *) ClearAll; NN = 5; KK = 11; \[Lambda] = -5/4; \[Sigma] = 2; a = (4 (2 + \[Lambda]))/(3 (3 + 2 \[Lambda])); (*Compute DNm1=D_N^\[Lambda]*) KN = Coefficient[(x^2 - 1) JacobiP[ NN - 2, \[Lambda] - 1/2, \[Lambda] - 1/2, x], x^NN]; DN = Simplify[ 1/KN (x^2 - 1) JacobiP[NN - 2, \[Lambda] - 1/2, \[Lambda] - 1/2, x]]; (*Compute DNm1=D_(N-1)^\[Lambda]*) KNm1 = Coefficient[ JacobiP[NN - 1, \[Lambda] - 1/2, \[Lambda] - 1/2, x], x^(NN - 1)]; DNm1 = Simplify[ 1/KNm1 JacobiP[NN - 1, \[Lambda] - 1/2, \[Lambda] - 1/2, x]]; (* Construct D_j^\[Lambda] for j=N-2,N-3,...,0, in the array \ DjLowerDegrees *) \[Beta]2 = Table[0, {j, 1, NN}]; (*\[Beta]2[[1]] must be zero*) ell = Table[0, {j, 1, NN}]; (*ell[[1]] will not contain any information*) \[Beta]2[[NN]] = Simplify[Coefficient[DN, x^(NN - 2)]]; \[Beta]2[[NN - 1]] = Simplify[Coefficient[DNm1, x^(NN - 3)]]; ell[[NN]] = Simplify[\[Beta]2[[NN - 1]] - \[Beta]2[[NN]]]; Clear[DjLowerDegrees]; DjLowerDegrees = Table[0, {k, 0, NN}]; DjLowerDegrees[[(NN) + 1]] = DN; DjLowerDegrees[[(NN - 1) + 1]] = DNm1; Do[{j = k + 2; DjLowerDegrees[[(NN - j) + 1]] = Simplify[-1/ ell[[NN - j + 2]] (DjLowerDegrees[[(NN - j + 2) + 1]] - x DjLowerDegrees[[(NN - j + 1) + 1]])]; If[j == NN - 2, \[Beta]2[[2]] = Simplify[DjLowerDegrees[[(2) + 1]] - x^2], \[Beta]2[[NN - j]] = Simplify[ Coefficient[DjLowerDegrees[[(NN - j) + 1]], x^(NN - j - 2)]]]; ell[[NN - j + 1]] = \[Beta]2[[NN - j]] - \[Beta]2[[NN - j + 1]]; }, {k, 0, NN - 2}]; (* Construct D_j^\[Lambda] for j=N+1,N+2,...,N+M, in the array \ DjUpperDegrees *) Clear[DjUpperDegrees]; DjUpperDegrees = Table[0, {k, 1, KK}];(* DjUpperDegrees [[k]]=D_{N+k-2}^\[Lambda]*) DjUpperDegrees[[1]] = DNm1; DjUpperDegrees[[2]] = DN; ellNp1 = Simplify[(a DN /. x -> a)/(\[Sigma] DNm1 /. x -> a)]; DjUpperDegrees[[3]] = Simplify[x DN - ellNp1 DNm1]; ellNpj = (\[Sigma] - 1)/\[Sigma]^2 a^2; Do[{ DjUpperDegrees[[j + 2]] = Simplify[ x DjUpperDegrees[[j + 1]] - ellNpj DjUpperDegrees[[j]]]; }, {j, 2, KK - 2}]; (*Print out DjLowerDegrees in standard form*) Print["N = ", NN, ", \[Lambda]=", \[Lambda], ", KK=", KK, ", a=", a] Do[{CoefRulesDj = Simplify[CoefficientRules[ DjLowerDegrees[[j]], {x}]]; DNPrint = TraditionalForm[FromCoefficientRules[CoefRulesDj, {x}], ParameterVariables :> {\[Lambda]}]; Print["D_", j - 1, "^\[Lambda] = ", TraditionalForm[DNPrint, ParameterVariables :> {\[Lambda]}], "."]}, {j, 1, NN + 1}]; (*Print out DjUpperDegrees in standard form*) Do[{CoefRulesDj = Simplify[CoefficientRules [DjUpperDegrees[[j]], {x}]]; DNPrint = TraditionalForm[FromCoefficientRules[CoefRulesDj, {x}], ParameterVariables :> {\[Lambda]}]; Print["D_", NN + j - 2, "^\[Lambda] = ", TraditionalForm[DNPrint, ParameterVariables :> {\[Lambda]}], "."];}, {j, 1, KK}];
Appendix: 2. The first 11 terms of the polynomial sequence \(\{D_m^{\lambda }\}_{m=0}^{\infty }\) with n = 5, k = 5, σ = 2, and \(a=\frac {4(2+\lambda )}{3(3+2\lambda )}\)
In this section we compute the first several terms of the sequence \(\{D_m^{\lambda }\}_{m=0}^{\infty }\) for a specific choice of parameters. The purpose of this example is to get a glimpse of the symbolic expressions for the polynomials for a general (not fixed) value of λ. The example also provides a way to verify correctness of programming for those readers who are interested to implement the algorithm developed in Section 4, using programming environment of their choice. We thus provide the first 11 terms of the polynomial sequence \(\{D_m^{\lambda }\}_{m=0}^{\infty }\) obtained using the algorithm developed in Section 4 with n = 5, k = 5, σ = 2, and \(a=\frac {4(2+\lambda )}{3(3+2\lambda )}\), where \(\lambda \in (-\frac {3}{2}, +\infty )\), λ≠− 1, 0 and λ≠(2k − 1)/2, k = 0, 1, 2,…:
Rights and permissions
About this article
Cite this article
Bihun, O., Driver, K. Orthogonal sequences constructed from quasi-orthogonal ultraspherical polynomials. Numer Algor 85, 503–522 (2020). https://doi.org/10.1007/s11075-019-00824-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-019-00824-5