-
-
Notifications
You must be signed in to change notification settings - Fork 482
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Symbolic orthogonal and some other holonomic polynomials #16670
Comments
comment:2
For the record, using FLINT's |
comment:3
Really? For me flint constructs T_10000 in 0.009 seconds while Sage's chebyshev_T takes 1 second. But evaluating a Chebyshev polynomial is a completely different problem. You want to do that by recurrence relations, not by constructing the polynomial and evaluating it. |
comment:4
Ah, that's true. I only tested at T_500. |
This comment has been minimized.
This comment has been minimized.
Changed branch from u/rws/make_all_orthogonal_polynomials_symbolic to none |
comment:6
The speed issue is now #16812 I think the scope of the ticket is too broad. Let's make it a meta-ticket. |
At the moment just the Chebyshev polynomials are symbolic. Missing are
hermite
,laguerre
,legendreP
,legendreQ
,ultraspherical
(=gegenbauer
), and, while the Stirling and Euler polynomials are not orthogonal, they are holonomic and belong to the standard repertoire, so we're including them here.Component: symbolics
Keywords: orthogonal, holonomic
Issue created by migration from https://trac.sagemath.org/ticket/16670
The text was updated successfully, but these errors were encountered: