DeepAI AI Chat
Log In Sign Up

Polynomial and rational measure modifications of orthogonal polynomials via infinite-dimensional banded matrix factorizations

by   Timon S. Gutleb, et al.
University of Oxford
University of Manitoba
Imperial College London

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.


page 1

page 2

page 3

page 4


Orthogonal polynomials on a class of planar algebraic curves

We construct bivariate orthogonal polynomials (OPs) on algebraic curves ...

Higher-order recurrence relations, Sobolev-type inner products and matrix factorizations

It is well known that Sobolev-type orthogonal polynomials with respect t...

On the computation of recurrence coefficients for univariate orthogonal polynomials

Associated to a finite measure on the real line with finite moments are ...

Gossip of Statistical Observations using Orthogonal Polynomials

Consider a network of agents connected by communication links, where eac...

Modified discrete Laguerre polynomials for efficient computation of exponentially bounded Matsubara sums

We develop a new type of orthogonal polynomial, the modified discrete La...

The conjugate gradient method with various viewpoints

Connections of the conjugate gradient (CG) method with other methods in ...