Fast algorithms for the multi-dimensional Jacobi polynomial transform
From MaRDI portal
Publication:2659758
DOI10.1016/j.acha.2020.01.004zbMath1467.65116arXiv1901.07275OpenAlexW3004868336MaRDI QIDQ2659758
Qiyuan Pang, James Bremer, Haizhao Yang
Publication date: 26 March 2021
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07275
fast Fourier transformmulti-dimensional Jacobi polynomial transformnon-oscillatory phase functionnonuniform transformsrandomized low-rank approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the existence of nonoscillatory phase functions for second order ordinary differential equations in the high-frequency regime
- Direct and inverse approximation theorems for the \(p\)-version of the finite element method in the framework of weighted Besov spaces. III: Inverse approximation theorems
- A fast and simple algorithm for the computation of Legendre coefficients
- Gegenbauer polynomials and semiseparable matrices
- Generalized Jacobi polynomials/functions and their applications
- Gegenbauer approximation and its applications to differential equations on the whole line
- On the numerical solution of second order ordinary differential equations in the high-frequency regime
- Jacobi approximations in certain Hilbert spaces and their applications to singular differential equations
- Optimal estimates for lower and upper bounds of approximation errors in the \(p\)-version of the finite element method in two dimensions
- A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization?
- An algorithm for the rapid evaluation of special function transforms
- A fast directional algorithm for high frequency acoustic scattering in two dimensions
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- Sublinear Randomized Algorithms for Skeleton Decompositions
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Fast Computation of Fourier Integral Operators
- Computing with Expansions in Gegenbauer Polynomials
- Fast algorithms for discrete polynomial transforms
- Spectral Methods and Their Applications
- Direct and Inverse Approximation Theorems for the p-Version of the Finite Element Method in the Framework of Weighted Besov Spaces. Part I: Approximability of Functions in the Weighted Besov Spaces
- 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
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- Accelerating the Nonuniform Fast Fourier Transform
- An Extension of MATLAB to Continuous Functions and Operators
- Chebfun in Three Dimensions
- An Extension of Chebfun to Two Dimensions
- A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
- Spectral Methods
- Fast algorithms for Jacobi expansions via nonoscillatory phase functions
- A fast algorithm for particle simulations
