Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations
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. We present several applications and numerical experiments using an open source implementation which make direct use of these results.
Authors
- Sheehan Olver (ORCID: https://orcid.org/0000-0001-6920-0826)
- Richard Mikaël Slevinsky
- Timon S. Gutleb (ORCID: https://orcid.org/0000-0002-8239-2372)
Institutions
- University of British Columbia (CA)
- Imperial College London (GB)
- The University of Winnipeg (CA)
Publication Details
- Journal
- Foundations of Computational Mathematics
- Published
- 2024-08-05
- DOI
- https://doi.org/10.1007/s10208-024-09671-w
- Citations
- 4
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.72
Funders
- Leverhulme Trust
- Natural Sciences and Engineering Research Council of Canada
- Engineering and Physical Sciences Research Council
- Division of Mathematical Sciences