An extra-component method for evaluating fast matrix-vector multiplication with special functions

DOI10.1007/s11075-022-01383-yWikidataQ113900674 ScholiaQ113900674MaRDI QIDQ2691900

Andrew V. Terekhov

Publication date: 30 March 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.11610

zbMATH Keywords

integral transforms; fast algorithms; Laguerre; Legendre; Chebyshev; Jacobi; discrete transforms

Mathematics Subject Classification ID

65-XX: Numerical analysis

Uses Software

• DLMF
• Chebfun
• SHTns

Cites Work

• Unnamed Item
• Unnamed Item
• The stabilization of high-order multistep schemes for the Laguerre one-way wave equation solver
• Fast conversion algorithms for orthogonal polynomials
• Recurrence relations and fast algorithms
• A fast algorithm for Chebyshev, Fourier, and sinc interpolation onto an irregular grid
• A fast transform for spherical harmonics
• Local cosine transform -- A method for the reduction of the blocking effect in JPEG
• The Laguerre finite difference one-way equation solver
• Numerical Fourier analysis
• Spectral Laguerre method for the approximate solution of time dependent problems
• On the fast Fourier transform of functions with singularities
• Fast and reliable high-accuracy computation of Gauss-Jacobi quadrature
• Generating the Laguerre expansion coefficients by solving a one-dimensional transport equation
• An algorithm for the rapid evaluation of special function transforms
• A fast Hermite transform
• The expansion in Gegenbauer polynomials: a simple method for the fast computation of the Gegenbauer coefficients
• Optimized local trigonometric bases
• Fast wavelet transforms and numerical algorithms I
• A Fast Algorithm for the Evaluation of Legendre Expansions
• The Fractional Fourier Transform and Applications
• Computing with Expansions in Gegenbauer Polynomials
• A Fast Computational Algorithm for the Discrete Cosine Transform
• Fast algorithms for discrete polynomial transforms
• Fast Fourier Transforms for Nonequispaced Data
• On the Laguerre Method for Numerically Inverting Laplace Transforms
• On the use of Hahn’s asymptotic formula and stabilized recurrence for a fast, simple and stable Chebyshev–Jacobi transform
• A Nonuniform Fast Fourier Transform Based on Low Rank Approximation
• Fast structured Jacobi-Jacobi transforms
• Accelerating the Nonuniform Fast Fourier Transform
• Rapid Computation of the Discrete Fourier Transform
• Discrete Cosine Transform
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Nonuniform fast fourier transforms using min-max interpolation
• A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
• Fast algorithms for Jacobi expansions via nonoscillatory phase functions