Computation of connection coefficients and measure modifications for orthogonal polynomials

DOI10.1007/s10543-011-0363-zzbMath1247.65026OpenAlexW2095079569MaRDI QIDQ438713

Jan S. Hesthaven, Akil C. Narayan

Publication date: 31 July 2012

Published in: BIT (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/190471

zbMATH Keywords

orthogonal polynomialsnumerical examplesfast Fourier transformJacobi polynomialsmatrix polynomialconnection coefficientsCholesky decompositionmeasure modifications

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical approximation and evaluation of special functions (33F05)

Related Items (5)

Fast algorithms using orthogonal polynomials ⋮ Well-conditioned fractional collocation methods using fractional Birkhoff interpolation basis ⋮ Optimal Error Estimates of Spectral Petrov--Galerkin and Collocation Methods for Initial Value Problems of Fractional Differential Equations ⋮ Computation of induced orthogonal polynomial distributions ⋮ Fast structured Jacobi-Jacobi transforms

Uses Software

• OPQ

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculation of Gauss quadratures with multiple free and fixed knots
• Adaptive sparse grid algorithms with applications to electromagnetic scattering under uncertainty
• Generalized Jacobi polynomials/functions and their applications
• Legendre and Chebyshev dual-Petrov-Galerkin methods for hyperbolic equations
• Polynomial chaos representation of spatio-temporal random fields from experimental measurements
• On the calculation of Jacobi matrices
• The condition of Vandermonde-like matrices involving orthogonal polynomials
• The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub
• Modeling uncertainty in flow simulations via generalized polynomial chaos.
• A more accurate algorithm for computing the Christoffel transformation
• Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
• A generalization of the Wiener rational basis functions on infinite intervals: Part I–derivation and properties
• Polynomial Chaos in Stochastic Finite Elements
• Spectral Methods for Time-Dependent Problems
• A Fast Algorithm for the Calculation of the Roots of Special Functions
• Protein labeling reactions in electrochemical microchannel flow: Numerical simulation and uncertainty propagation
• Algebraic Methods for Modified Orthogonal Polynomials
• Generalized Jacobi Weights, Christoffel Functions, and Jacobi Polynomials
• Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
• On the Gibbs Phenomenon and Its Resolution
• Physical Systems with Random Uncertainties: Chaos Representations with Arbitrary Probability Measure
• Calculation of Gauss Quadrature Rules
• An Implemention of Christoffel's Theorem in the Theory of Orthogonal Polynomials

This page was built for publication: Computation of connection coefficients and measure modifications for orthogonal polynomials