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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations

Sheehan Olver, Richard Mikaël Slevinsky, Timon S. Gutleb
4 citations
Foundations of Computational Mathematics
Matrix Theory and Algorithms
0.72
article

Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations

Sheehan Olver, Richard Mikaël Slevinsky, Timon S. Gutleb
article en
4 citations

Abstract

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.

Foundations of Computational MathematicsVol. 25(5)
University of British Columbia (CA), Imperial College London (GB), The University of Winnipeg (CA)
Leverhulme Trust, Natural Sciences and Engineering Research Council of Canada, Engineering and Physical Sciences Research Council, Division of Mathematical Sciences
Openalex Percentile: Top 27%
Matrix Theory and Algorithms
0.72
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Polynomial and Rational Measure Modifications of Orthogonal Polynomials via Infinite-Dimensional Banded Matrix Factorizations — Sheehan Olver, Richard Mikaël Slevinsky, et al. · Foundations of Computational Mathematics (2024) | TGRS Research Map | TGRS