Computing with Expansions in Gegenbauer Polynomials

DOI10.1137/070703065zbMath1188.42016OpenAlexW2004933271MaRDI QIDQ3567022

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

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

Related Items (12)

Fast algorithms using orthogonal polynomials ⋮ 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 ⋮ Fast structured Jacobi-Jacobi transforms ⋮ Fast polynomial transforms based on Toeplitz and Hankel matrices ⋮ High-order shifted Gegenbauer integral pseudo-spectral method for solving differential equations of Lane-Emden type ⋮ 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 ⋮ Structural analysis of matrix integration operators in polynomial bases ⋮ On symmetrizing the ultraspherical spectral method for self-adjoint problems ⋮ Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series

Uses Software

• FFTW

This page was built for publication: Computing with Expansions in Gegenbauer Polynomials