Pages that link to "Item:Q629903"

The following pages link to A fast and simple algorithm for the computation of Legendre coefficients (Q629903):

Displaying 11 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)
• A matrix method for fractional Sturm-Liouville problems on bounded domain (Q1693587) (← 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 Optimal Estimates and Comparison of Gegenbauer Expansion Coefficients (Q2810562) (← links)
• Fast polynomial transforms based on Toeplitz and Hankel matrices (Q4637582) (← links)