Computing with expansions in Gegenbauer polynomials

DOI10.1137/070703065MaRDI QIDQ3567022zbMATH OpenOpenAlexFDO

Authors Jens Keiner

Publication date 10 June 2010

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/21f8bf271fabf9f7dd350beef44a44485a445a5c

zbMATH Keywords

fast algorithmsGegenbauer polynomialspolynomial transforms

Mathematics Subject Classification ID

Other transformations of harmonic type (42C20) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• The expansion in Gegenbauer polynomials: a simple method for the fast computation of the Gegenbauer coefficients
• Gegenbauer polynomials and semiseparable matrices
• On rapid computation of expansions in ultraspherical polynomials
• Computing expansion coefficients in orthogonal bases of ultraspherical polynomials
• On expansions in orthogonal polynomials

Cited in

(20)

• High-order shifted Gegenbauer integral pseudo-spectral method for solving differential equations of Lane-Emden type
• Computing expansion coefficients in orthogonal bases of ultraspherical polynomials
• Structural analysis of matrix integration operators in polynomial bases
• The spectral connection matrix for classical orthogonal polynomials of a single parameter
• High-order Gegenbauer integral spectral element method integrated with an adaptive Chebyshev optimization strategy for solving linear singularly perturbed differential equations
• Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
• The expansion in Gegenbauer polynomials: a simple method for the fast computation of the Gegenbauer coefficients
• Fast algorithms for the multi-dimensional Jacobi polynomial transform
• Fast associated classical orthogonal polynomial transforms
• An extra-component method for evaluating fast matrix-vector multiplication with special functions
• On the optimal estimates and comparison of Gegenbauer expansion coefficients
• On rapid computation of expansions in ultraspherical polynomials
• Fast structured Jacobi-Jacobi transforms
• Fast polynomial transforms based on Toeplitz and Hankel matrices
• Fast algorithms using orthogonal polynomials
• Computing exp(- A) b with Laguerre polynomials
• A faster multipole Legendre-Chebyshev transform
• Efficient multivariate kernel based schemes for nonparametric functions approximations
• Fast measure modification of orthogonal polynomials via matrices with displacement or hierarchical off-diagonal low-rank structure
• On symmetrizing the ultraspherical spectral method for self-adjoint problems

Describes a project that uses

Uses Software

• FFTW

This page was built for publication: Computing with expansions in Gegenbauer polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567022)