Polynomial and rational measure modifications of orthogonal polynomials via infinite-dimensional banded matrix factorizations
Preprint
Abstract
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via infinite-dimensional banded matrix factorizations and may be used to compute the modified Jacobi matrices all in linear complexity with respect to the truncation degree. A family of orthogonal polynomials with modified classical weights is constructed that support banded differentiation matrices, enabling sparse spectral methods with modified classical orthogonal polynomials.Keywords
All Related Versions
This publication has 42 references indexed in Scilit:
- Orthogonal Polynomials on Planar Cubic CurvesFoundations of Computational Mathematics, 2021
- Orthogonal Systems with a Skew-Symmetric Differentiation MatrixFoundations of Computational Mathematics, 2019
- On the infinite-dimensional QR algorithmNumerische Mathematik, 2019
- Introduction to Large Truncated Toeplitz Matrices1999
- On the Cholesky factorization of the Gram matrix of locally supported functionsBIT Numerical Mathematics, 1995
- Jacobi matrices for measures modified by a rational factorNumerical Algorithms, 1994
- Jacobi matrices for sums of weight functionsBIT Numerical Mathematics, 1992
- Toda flows with infinitely many variablesJournal of Functional Analysis, 1985
- On the calculation of Jacobi MatricesLinear Algebra and its Applications, 1983
- Über Sturm-Liouvillesche PolynomsystemeMathematische Zeitschrift, 1929