Fast structured Jacobi-Jacobi transforms
DOI10.1090/MCOM/3377OpenAlexW2804976034WikidataQ129772173 ScholiaQ129772173MaRDI QIDQ4629375FDOQ4629375
Authors: Jie Shen, Yingwei Wang, Jianlin Xia
Publication date: 22 March 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3377
Recommendations
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- scientific article; zbMATH DE number 992819
- scientific article; zbMATH DE number 4007552
- Fast Reciprocal Jacket Transform With Many Parameters
- Fast and accurate algorithms for Jacobi-Stirling matrices
- Fast and approximate computation of Laplace and Fourier transforms
- Fast transforms of Toeplitz matrices
- Fast computation of partial Fourier transforms
- Fast generalized Fourier transforms
- Fast discrete transforms by means of eigenpolynomials
structured matrixconnection matrixrecurrence formulalow-rank propertyChebyshev-Jacobi transformJacobi-Jacobi transform
Numerical interpolation (65D05) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Algorithm 840: computation of grid points, quadrature weights and derivatives for spectral element methods using prolate spheroidal wave functions---prolate elements
- Fast algorithms for hierarchically semiseparable matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- On the efficient computation of high-dimensional integrals and the approximation by exponential sums
- Jacobi approximations in certain Hilbert spaces and their applications to singular differential equations
- Spectral methods. Algorithms, analysis and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral Methods
- Jacobi approximations in non-uniformly Jacobi-weighted Sobolev spaces
- Fast algorithms for spherical harmonic expansions. II.
- Spectral methods on triangles and other domains
- The asymptotic expansion of a ratio of gamma functions
- On the Gibbs Phenomenon and Its Resolution
- Connection Coefficients of Orthogonal Polynomials
- Supersensitivity due to uncertain boundary conditions
- Connection coefficients between orthogonal polynomials and the canonical sequence: An approach based on symbolic computation
- Optimal error estimates in Jacobi-weighted Sobolev spaces for polynomial approximations on the triangle
- A fast, simple, and stable Chebyshev-Legendre transform using an asymptotic formula
- A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
- Title not available (Why is that?)
- A fast algorithm for particle simulations
- Fast Algorithms for Spherical Harmonic Expansions
- Quick construction of recurrence relations for the Jacobi coefficients
- A Fast Algorithm for the Evaluation of Legendre Expansions
- Computation of connection coefficients and measure modifications for orthogonal polynomials
- Superfast and stable structured solvers for Toeplitz least squares via randomized sampling
- On the complexity of some hierarchical structured matrix algorithms
- A superfast structured solver for Toeplitz linear systems via randomized sampling
- On the stability of some hierarchical rank structured matrix algorithms
- Error Bounds for Asymptotic Expansions of the Ratio of Two Gamma Functions
- A fast spherical harmonics transform algorithm
- Computing with expansions in Gegenbauer polynomials
- Large degree asymptotics of generalized Bernoulli and Euler polynomials
- Recurrence relations for connection coefficients between two families of orthogonal polynomials
- A recurrence scheme for converting from one orthogonal expansion into another
- Generalized discrete spherical harmonic transforms
- Müntz-Galerkin methods and applications to mixed Dirichlet-Neumann boundary value problems
- Connection coefficients for orthogonal polynomials: Symbolic computations, verifications and demonstrations in the Mathematica language
- Gegenbauer polynomials and semiseparable matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast polynomial transforms based on Toeplitz and Hankel matrices
- Highly accurate pseudospectral approximations of the prolate spheroidal wave equation for any bandwidth parameter and zonal wavenumber
- The spectral connection matrix for classical orthogonal polynomials of a single parameter
- The spectral connection matrix for any change of basis within the classical real orthogonal polynomials
Cited In (9)
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- Two-level spectral methods for nonlinear elliptic equations with multiple solutions
- Fast reverse jacket transform as an alternative representation of the \(N\)-point fast Fourier transform
- A faster multipole Legendre-Chebyshev transform
- An extra-component method for evaluating fast matrix-vector multiplication with special functions
- A fast wavelet block Jacobi method
- Jacobian spectral collocation method for spatio-temporal coupled Fokker-Planck equation with variable-order fractional derivative
- Fast Reciprocal Jacket Transform With Many Parameters
- Title not available (Why is that?)
Uses Software
This page was built for publication: Fast structured Jacobi-Jacobi transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629375)