Pages that link to "Item:Q2564266"
From MaRDI portal
The following pages link to A new algorithm for computing orthogonal polynomials (Q2564266):
Displaying 9 items.
- Fast conversion algorithms for orthogonal polynomials (Q1044602) (← links)
- A fast algorithm for orthogonalizing polynomials on an arbitrarily shaped region (revised version). (Q1367132) (← links)
- A fast algorithm for generalized Hankel matrices arising in finite-moment problems (Q1373307) (← links)
- Construction of polynomials that are orthogonal with respect to a discrete bilinear form (Q1895893) (← links)
- The stable computation of formal orthogonal polynomials (Q1911437) (← links)
- Combinatorial and hypergeometric identities via the Legendre polynomials -- a computational approach (Q2485617) (← links)
- (Q3377645) (← links)
- Remark on algorithm 726 (Q4256923) (← links)
- Fast algorithms using orthogonal polynomials (Q5887824) (← links)