Recurrence relations and fast algorithms
type: Item
instance of: scholarly article
title: Recurrence relations and fast algorithms
zbMATH Open document ID: 1182.65195
author: Mark Tygert
published in: Applied and Computational Harmonic Analysis
publication date: 2009-12-15T00:00:00Z
review text: Faster algorithms are constructed for evaluating transforms associated with families of functions which satisfy recurrence relations. The algorithms are efficient in the sense that their computation costs are proportional to \(n\ln n\) at any fixed precision of computations, where \(n\) is the amount of input and output data.
Mathematics Subject Classification ID: 65Q30
Mathematics Subject Classification ID: 33F05
Mathematics Subject Classification ID: 65D20
zbMATH DE Number: 5648449
zbMATH Keywords: fast algorithms
zbMATH Keywords: special functions
zbMATH Keywords: pseudospectral
zbMATH Keywords: transforms
zbMATH Keywords: recurrence relations
describes a project that uses: FFTW
MaRDI profile type: Publication
full work available at URL: j.acha.2009.07.005
OpenAlex ID: W2138106543
cites work: A Fast Algorithm for the Calculation of the Roots of Special Functions
cites work: Calculation of Gauss Quadrature Rules
cites work: A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
cites work: A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
cites work: A fast spherical filter with uniform resolution
cites work: Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential Theory
cites work: Q5289008
cites work: Fast Algorithms for Spherical Harmonic Expansions
cites work: Fast algorithms for spherical harmonic expansions. II.
cites work: Q3290777
DOI: 10.1016/J.ACHA.2009.07.005
description: scientific article; zbMATH DE number 5648449