Fast conversion algorithms for orthogonal polynomials

DOI10.1016/j.laa.2009.08.002zbMath1182.65037OpenAlexW2165632705MaRDI QIDQ1044602

Éric Schost, Alin Bostan, Bruno Salvy

Publication date: 18 December 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.08.002

zbMATH Keywords

complexityorthogonal polynomialsfast algorithmsbasis conversionconversion algorithmstransposed algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Computation of special functions and constants, construction of tables (65D20) Numerical methods for trigonometric approximation and interpolation (65T40) Complexity and performance of numerical algorithms (65Y20) Numerical approximation and evaluation of special functions (33F05)

Related Items (4)

A fast discrete spectral method for stochastic partial differential equations ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ Orthogonal polynomial expansions on sparse grids ⋮ Enclosing Chebyshev Expansions in Linear Time

Uses Software

• FHT

Cites Work

• New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
• Combinatorial aspects of continued fractions
• On fast multiplication of polynomials over arbitrary algebras
• The middle product algorithm. I: Speeding up the division and square root of power series
• A fast algorithm for expansion over spherical harmonics
• Fast multiplication of large numbers
• Fast algorithms for discrete polynomial transforms
• Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
• Power series composition and change of basis
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
• The Relation of the Classical Orthogonal Polynomials to the Polynomials of Appell
• Fast inversion of triangular Toeplitz matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast conversion algorithms for orthogonal polynomials