Pages that link to "Item:Q629903"
From MaRDI portal
The following pages link to A fast and simple algorithm for the computation of Legendre coefficients (Q629903):
Displaying 24 items.
- Model order reduction of MIMO bilinear systems by multi-order Arnoldi method (Q313264) (← links)
- Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- Arnoldi-based model order reduction for linear systems with inhomogeneous initial conditions (Q682731) (← links)
- On fast algorithms for the evaluation of Legendre coefficients (Q691739) (← links)
- An algorithm for the numerical evaluation of the associated Legendre functions that runs in time independent of degree and order (Q1640835) (← links)
- A matrix method for fractional Sturm-Liouville problems on bounded domain (Q1693587) (← links)
- On the computation of discrete Legendre polynomial coefficients (Q1801481) (← links)
- Representation of sparse Legendre expansions (Q1930163) (← links)
- On expansions in orthogonal polynomials (Q1946476) (← links)
- How much faster does the best polynomial approximation converge than Legendre projection? (Q1996234) (← links)
- Preconditioned Legendre spectral Galerkin methods for the non-separable elliptic equation (Q2113655) (← links)
- Fast algorithms for the multi-dimensional Jacobi polynomial transform (Q2659758) (← links)
- On the efficient parallel computation of Legendre transforms (Q2719280) (← links)
- On the optimal estimates and comparison of Gegenbauer expansion coefficients (Q2810562) (← links)
- An algorithm for the convolution of Legendre series (Q2878950) (← links)
- On rapid computation of expansions in ultraspherical polynomials (Q2882344) (← links)
- \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing (Q2909301) (← links)
- A Hybrid Analytical-Numerical Technique for Elliptic PDEs (Q4632008) (← links)
- Fast polynomial transforms based on Toeplitz and Hankel matrices (Q4637582) (← links)
- A fast FFT-based discrete Legendre transform (Q4683735) (← links)
- Dimension reduction for <i>k</i>-power bilinear systems using orthogonal polynomials and Arnoldi algorithm (Q5028679) (← links)
- (Q5263442) (← links)
- On the convergence rates of Legendre approximation (Q5389436) (← links)
