Fast algorithms for discrete polynomial transforms
From MaRDI portal
Publication:4210958
DOI10.1090/S0025-5718-98-00975-2zbMath0904.65145OpenAlexW1978798278MaRDI QIDQ4210958
Manfred Tasche, Daniel Potts, Gabriele Drauschke
Publication date: 10 September 1998
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-98-00975-2
algorithmnumerical examplesmatrix-vector productfast polynomial transformChebyshev knotsfast cosine transformcascade summationVandermonde-like matrixdiscrete polynomial transform
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical methods for discrete and fast Fourier transforms (65T50)
Related Items
Fast algorithms for discrete polynomial transforms on arbitrary grids, Local quadrature formulas on the sphere, Reconstructing a function on the sphere from its means along vertical slices, Fast algorithms for the multi-dimensional Jacobi polynomial transform, Scattered data approximation on the bisphere and application to texture analysis, Learning multivariate functions with low-dimensional structures using polynomial bases, Sliced optimal transport on the sphere, Diagonalized Legendre spectral methods using Sobolev orthogonal polynomials for elliptic boundary value problems, Sparse Legendre expansions via \(\ell_1\)-minimization, Fast SGL Fourier transforms for scattered data, A fast and simple algorithm for the computation of Legendre coefficients, On expansions in orthogonal polynomials, An extra-component method for evaluating fast matrix-vector multiplication with special functions, Fast spherical Fourier algorithms., Orthogonal polynomial expansions on sparse grids, Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature, A Hybrid Analytical-Numerical Technique for Elliptic PDEs, Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice, Fast polynomial transforms based on Toeplitz and Hankel matrices, Quadrature in Besov spaces on the Euclidean sphere, Polynomial operators and local approximation of solutions of pseudo-differential equations on the sphere, Fast evaluation of quadrature formulae on the sphere, Weighted quadrature formulas and approximation by zonal function networks on the sphere, Uniform approximation on \([-1,1\) via discrete de la Vallée Poussin means], On the Numerical Solution of a Hypersingular Integral Equation with Fixed Singularities, An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials, Computing Invariant Sets of Random Differential Equations Using Polynomial Chaos, Polynomial Processes for Power Prices, A note on stability results for scattered data interpolation on Euclidean spheres, A polynomial interpolation process at quasi-Chebyshev nodes with the FFT, A fast algorithm for nonequispaced Fourier transforms on the rotation group, Fast conversion algorithms for orthogonal polynomials
Cites Work
- Fast polynomial multiplication and convolutions related to the discrete cosine transform
- The condition of Vandermonde-like matrices involving orthogonal polynomials
- Fast radix-\(p\) discrete cosine transform
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation
- Computing Fourier transforms and convolutions on the 2-sphere
- On the associated orthogonal polynomials
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal Polynomials
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
