Symbolic computation of recurrence coefficients for polynomials orthogonal with respect to the Szegő-Bernstein weights
From MaRDI portal
Publication:6167869
DOI10.3934/mfc.2022049OpenAlexW4312856200MaRDI QIDQ6167869
Publication date: 7 August 2023
Published in: Mathematical Foundations of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mfc.2022049
softwareorthogonal polynomialsweight functionsymbolic computationthree-term recurrence relationChebyshev weightsmodified moment
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gauss-Kronrod quadrature formulae for weight functions of Bernstein- Szegö type. II
- Grauss-Kronrod quadrature formulae for weight functions of Bernstein- Szegö type
- How to generate unknown orthogonal polynomials out of known orthogonal polynomials
- Weighted integration of periodic functions on the real line.
- Orthogonal polynomials relative to a generalized Marchenko-Pastur probability measure
- Interpolation Processes
- On Generating Orthogonal Polynomials
- Recent advances in asymptotic analysis
This page was built for publication: Symbolic computation of recurrence coefficients for polynomials orthogonal with respect to the Szegő-Bernstein weights