Pages that link to "Item:Q4210958"
From MaRDI portal
The following pages link to Fast algorithms for discrete polynomial transforms (Q4210958):
Displaying 37 items.
- Reconstructing a function on the sphere from its means along vertical slices (Q326412) (← links)
- Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755) (← links)
- Orthogonal polynomial expansions on sparse grids (Q457562) (← links)
- Scattered data approximation on the bisphere and application to texture analysis (Q600863) (← links)
- A fast and simple algorithm for the computation of Legendre coefficients (Q629903) (← links)
- Uniform approximation on \([-1,1]\) via discrete de la Vallée Poussin means (Q715128) (← links)
- Algebraic signal processing theory: Cooley-Tukey type algorithms on the 2-D hexagonal spatial lattice (Q937227) (← links)
- A note on stability results for scattered data interpolation on Euclidean spheres (Q1016133) (← links)
- A fast algorithm for nonequispaced Fourier transforms on the rotation group (Q1039276) (← links)
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- Fast discrete transforms by means of eigenpolynomials (Q1311982) (← links)
- Fast spherical Fourier algorithms. (Q1412818) (← links)
- Diagonalized Legendre spectral methods using Sobolev orthogonal polynomials for elliptic boundary value problems (Q1696838) (← links)
- Fast algorithms for discrete polynomial transforms on arbitrary grids (Q1874677) (← links)
- Local quadrature formulas on the sphere (Q1888380) (← links)
- On expansions in orthogonal polynomials (Q1946476) (← links)
- Fast SGL Fourier transforms for scattered data (Q2197962) (← links)
- Quadrature in Besov spaces on the Euclidean sphere (Q2465286) (← links)
- Polynomial operators and local approximation of solutions of pseudo-differential equations on the sphere (Q2491149) (← links)
- Weighted quadrature formulas and approximation by zonal function networks on the sphere (Q2496179) (← links)
- An alternative to Slepian functions on the unit sphere -- a space-frequency analysis based on localized spherical polynomials (Q2512833) (← links)
- Fast algorithms for the multi-dimensional Jacobi polynomial transform (Q2659758) (← links)
- Learning multivariate functions with low-dimensional structures using polynomial bases (Q2667104) (← links)
- An extra-component method for evaluating fast matrix-vector multiplication with special functions (Q2691900) (← links)
- Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature (Q2719068) (← links)
- Multidimensional polynomial transform algorithm for multidimensional discrete \(W\) transform (Q2723640) (← links)
- A polynomial interpolation process at quasi-Chebyshev nodes with the FFT (Q3094285) (← links)
- On the Numerical Solution of a Hypersingular Integral Equation with Fixed Singularities (Q3612911) (← links)
- (Q4226724) (← links)
- A Hybrid Analytical-Numerical Technique for Elliptic PDEs (Q4632008) (← links)
- Fast polynomial transforms based on Toeplitz and Hankel matrices (Q4637582) (← links)
- Computing Invariant Sets of Random Differential Equations Using Polynomial Chaos (Q4961112) (← links)
- Polynomial Processes for Power Prices (Q5217497) (← links)
- Fast evaluation of quadrature formulae on the sphere (Q5429506) (← links)
- Sliced optimal transport on the sphere (Q6070746) (← links)
- The \(G\)-invariant graph Laplacian. I: Convergence rate and eigendecomposition. (Q6499001) (← links)
- An adaptive orthogonal basis method for computing multiple solutions of differential equations with polynomial nonlinearities (Q6569674) (← links)
