Fast conversion algorithms for orthogonal polynomials
type: Item
instance of: scholarly article
title: Fast conversion algorithms for orthogonal polynomials
zbMATH Open document ID: 1182.65037
author: Alin Bostan
author: Bruno Salvy
author: Éric Schost
published in: Linear Algebra and its Applications
publication date: 2009-12-18T00:00:00Z
review text: Efficient conversion algorithms for orthogonal polynomials are presented. A known conversion algorithm from an arbitrary orthogonal basis to the monomial basis is described first and a new algorithm with same complexity is deduced for the conversion operation.
Mathematics Subject Classification ID: 65D20
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 33C45
Mathematics Subject Classification ID: 33F05
Mathematics Subject Classification ID: 42C05
Mathematics Subject Classification ID: 65T40
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5650034
zbMATH Keywords: fast algorithms
zbMATH Keywords: transposed algorithms
zbMATH Keywords: basis conversion
zbMATH Keywords: orthogonal polynomials
zbMATH Keywords: conversion algorithms
zbMATH Keywords: complexity
describes a project that uses: FHT
MaRDI profile type: Publication
full work available at URL: j.laa.2009.08.002
OpenAlex ID: W2165632705
cites work: Q4660643
cites work: Power series composition and change of basis
cites work: Q4331740
cites work: On fast multiplication of polynomials over arbitrary algebras
cites work: Q4170993
cites work: Fast inversion of triangular Toeplitz matrices
cites work: Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
cites work: Combinatorial aspects of continued fractions
cites work: A fast algorithm for expansion over spherical harmonics
cites work: Modern computer algebra
cites work: The middle product algorithm. I: Speeding up the division and square root of power series
cites work: Q2724521
cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
cites work: New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
cites work: Q2760974
cites work: Fast algorithms for discrete polynomial transforms
cites work: Fast multiplication of large numbers
cites work: The Relation of the Classical Orthogonal Polynomials to the Polynomials of Appell
cites work: An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
cites work: Q4003887
DOI: 10.1016/J.LAA.2009.08.002
Recommended article: Fast algorithms using orthogonal polynomials
Recommended article: Fast associated classical orthogonal polynomial transforms
Recommended article: Fast algorithms for discrete polynomial transforms
Recommended article: Fast algorithms for the multi-dimensional Jacobi polynomial transform
Recommended article: A new algorithm for computing orthogonal polynomials
Recommended article: Fast decreasing and orthogonal polynomials
Recommended article: Fast algorithms for discrete polynomial transforms on arbitrary grids
Recommended article: A Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
Recommended article: A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version).
Recommended article: Acceleration of Convergence of Sequences via Orthogonal Polynomials
description: scientific article; zbMATH DE number 5650034