Fast polynomial transforms based on Toeplitz and Hankel matrices
From MaRDI portal
Publication:4637582
DOI10.1090/mcom/3277zbMath1478.65147arXiv1604.07486OpenAlexW2964132515MaRDI QIDQ4637582
Alex Townsend, Marcus Webb, Sheehan Olver
Publication date: 24 April 2018
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07486
Chebyshev polynomialsorthogonal polynomialsfast Fourier transformLegendre polynomialsconversion matrixpolynomial basis conversionfast polynomial transformsToeplitz-dot-Hankel matrix
Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05) Numerical methods for discrete and fast Fourier transforms (65T50) Toeplitz, Cauchy, and related matrices (15B05)
Related Items (25)
Fast algorithms using orthogonal polynomials ⋮ An iterative domain decomposition, spectral finite element method on non-conforming meshes suitable for high frequency Helmholtz problems ⋮ Fast algorithms for the multi-dimensional Jacobi polynomial transform ⋮ Weakly regular Sturm-Liouville problems: a corrected spectral matrix method ⋮ Fast associated classical orthogonal polynomial transforms ⋮ A Fast and Spectrally Convergent Algorithm for Rational-Order Fractional Integral and Differential Equations ⋮ Computing equilibrium measures with power law kernels ⋮ On the Singular Values of Matrices with Displacement Structure ⋮ Sobolev‐orthogonal systems with tridiagonal skew‐Hermitian differentiation matrices ⋮ Optimal error estimates of spectral Galerkin method for mixed diffusion equations ⋮ A Nonuniform Fast Fourier Transform Based on Low Rank Approximation ⋮ Orthogonal polynomials in and on a quadratic surface of revolution ⋮ Computing with Functions in the Ball ⋮ A spectral Galerkin approximation of optimal control problem governed by fractional advection-diffusion-reaction equations ⋮ Pricing European-type, early-exercise and discrete barrier options using an algorithm for the convolution of Legendre series ⋮ Fast structured Jacobi-Jacobi transforms ⋮ Fast spectral Petrov-Galerkin method for fractional elliptic equations ⋮ Non-homogeneous wave equation on a cone ⋮ How much faster does the best polynomial approximation converge than Legendre projection? ⋮ Polynomial (chaos) approximation of maximum eigenvalue functions. Efficiency and limitations ⋮ Optimal Regularity and Error Estimates of a Spectral Galerkin Method for Fractional Advection-Diffusion-Reaction Equations ⋮ Bounds on the Singular Values of Matrices with Displacement Structure ⋮ On spectral Petrov-Galerkin method for solving optimal control problem governed by a two-sided fractional diffusion equation ⋮ Sharp error estimates of a spectral Galerkin method for a diffusion-reaction equation with integral fractional Laplacian on a disk ⋮ Correlators of Polynomial Processes
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 low-rank approximation by the pivoted Cholesky decomposition
- Fast evaluation of real and complex exponential sums
- A fast and simple algorithm for the computation of Legendre coefficients
- How to choose modified moments?
- The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
- Strong rank revealing Cholesky factorization
- A fast symmetric SVD algorithm for square Hankel matrices
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- A Fast and Well-Conditioned Spectral Method
- An Algorithm for the Convolution of Legendre Series
- On Rapid Computation of Expansions in Ultraspherical Polynomials
- Julia: A Fresh Approach to Numerical Computing
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Computing with Expansions in Gegenbauer Polynomials
- Fast algorithms for discrete polynomial transforms
- Efficient Spectral-Galerkin Method I. Direct Solvers of Second- and Fourth-Order Equations Using Legendre Polynomials
- The Chebyshev–Legendre Method: Implementing Legendre Methods on Chebyshev Points
- On the use of Hahn’s asymptotic formula and stabilized recurrence for a fast, simple and stable Chebyshev–Jacobi transform
- On the Singular Values of Matrices with Displacement Structure
- A fast FFT-based discrete Legendre transform
- Rapid Computation of the Discrete Fourier Transform
- Continuous analogues of matrix factorizations
- A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
- Implementing Clenshaw-Curtis quadrature, I methodology and experience
- Some connection and linearization problems for polynomials in and beyond the Askey scheme
This page was built for publication: Fast polynomial transforms based on Toeplitz and Hankel matrices
