On the computation of recurrence coefficients for univariate orthogonal polynomials
From MaRDI portal
Publication:2051060
Abstract: Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern computational tools that facilitate evaluation and manipulation of polynomials with respect to the measure, and such tasks are foundational in numerical approximation and quadrature. Although the recurrence coefficients for classical measures are known explicitly, those for nonclassical measures must typically be numerically computed. We survey and review existing approaches for computing these recurrence coefficients for univariate orthogonal polynomial families and propose a novel "predictor-corrector" algorithm for a general class of continuous measures. We combine the predictor-corrector scheme with a stabilized Lanczos procedure for a new hybrid algorithm that computes recurrence coefficients for a fairly wide class of measures that can have both continuous and discrete parts. We evaluate the new algorithms against existing methods in terms of accuracy and efficiency.
Recommendations
- scientific article; zbMATH DE number 4142744
- On generating orthogonal polynomials for discrete measures
- scientific article; zbMATH DE number 811957
- A method to compute recurrence relation coefficients for bivariate orthogonal polynomials by unitary matrix transformations
- scientific article; zbMATH DE number 1004068
Cites work
- A class of orthogonal polynomials
- A proof of Freud's conjecture for exponential weights
- Algorithm 726: ORTHPOL–a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules
- An algorithm for Gaussian quadrature given modified moments
- Bernstein's inequality in \(L^p\) for \(0<p<1\) and \((C,1)\) bounds for orthogonal polynomials
- Discrete Painlevé equations for recurrence coefficients of orthogonal polynomials
- Gaussian quadrature and polynomial approximation for one-dimensional ridge functions
- scientific article; zbMATH DE number 3165685 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 3512532 (Why is no real title available?)
- scientific article; zbMATH DE number 3605240 (Why is no real title available?)
- scientific article; zbMATH DE number 2107939 (Why is no real title available?)
- Introduction to uncertainty quantification
- Modified moments and Gaussian quadratures
- Nonnegative solutions of a nonlinear recurrence
- On Generating Orthogonal Polynomials
- On some orthogonal polynomials of interest in theoretical chemistry
- Orthogonal polynomials, quadrature, and approximation: computational methods and software (in Matlab)
- Ridge functions
- The numerically stable reconstruction of Jacobi matrices from spectral data
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- UncertainSCI
- Univariate_ttr_examples
- Variable-precision recurrence coefficients for nonstandard orthogonal polynomials
- vpa
Cited in
(14)- On the generation of orthogonal polynomials using asymptotic methods for recurrence coefficients
- Tau-function constructions of the recurrence coefficients of orthogonal polynomials
- Recurrence coefficients of orthogonal polynomials with respect to some self-similar singular distributions
- Computation of induced orthogonal polynomial distributions
- Computing recursive orthogonal polynomial with Schur complements
- Calculating bivariate orthonormal polynomials by recurrence
- On the Computation of the Coefficients of s-Orthogonal Polynomials
- scientific article; zbMATH DE number 811957 (Why is no real title available?)
- Efficient recurrence relations for univariate and multivariate Taylor series coefficients
- scientific article; zbMATH DE number 7640513 (Why is no real title available?)
- A Stieltjes Algorithm for Generating Multivariate Orthogonal Polynomials
- Symbolic computation of recurrence coefficients for polynomials orthogonal with respect to the Szegő-Bernstein weights
- A Riemann-Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals
- Computing recurrence coefficients of multiple orthogonal polynomials
Describes a project that uses
Uses Software
This page was built for publication: On the computation of recurrence coefficients for univariate orthogonal polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051060)
