#9706: Symbolic Chebyshev polynomials
-------------------------------------+-------------------------------------
       Reporter:  maldun             |        Owner:  burcin, maldun
           Type:  enhancement        |       Status:  needs_review
       Priority:  major              |    Milestone:  sage-5.13
      Component:  symbolics          |   Resolution:
       Keywords:  orthogonal         |    Merged in:
  polynomials, symbolics             |    Reviewers:  Burcin Erocal, Travis
        Authors:  Stefan Reiterer    |  Scrimshaw, Stefan Reiterer, Jeroen
Report Upstream:  N/A                |  Demeyer
         Branch:                     |  Work issues:
   Dependencies:  #864, #9640,       |       Commit:
  #10018, #11868, #15422             |     Stopgaps:
-------------------------------------+-------------------------------------
Changes (by {'newvalue': u'Stefan Reiterer', 'oldvalue': u'Stefan Reiterer, 
Travis Scrimshaw'}):

 * author:  Stefan Reiterer, Travis Scrimshaw => Stefan Reiterer


Comment:

 Replying to [comment:114 jdemeyer]:
 > If the various orthogonal polynomials are so different, then perhaps the
 simple answer is that we shouldn't try to force a generic `_eval_` which
 will work for all orthogonal polynomials.
 >
 > We could have a common superclass for both kinds of Chebyshev
 polynomials and implement `_eval_()` there. For Legendre polynomials, we
 could implement a different `_eval_()`. That would be a much simpler
 solution than making an overly complicated generic `_eval_()`.

 I think this would be a good course of action, and that we should put
 other orthogonal polynomials in other tickets. However, I think it might
 be worthwhile to at least diagram/pseudocode the overall class structure
 we want at the end of the day. Currently I believe the proposal is
 something like:
 {{{
 * Orthogonal polynomials

   * Chebyshev polynomials
     - general _evel_(x, n) method

     * Chebyshev T
       - specific code (ex. _evalf_() method), recursions, ...
     * Chebyshev U
       - specific code (ex. _evalf_() method), recursions, ...

   * Legendre polynomials
     - general _evel_(x, n) method

     * Legendre P
     * Legendre Q

   * Gegenbauer polynomials
     - an _evel_(x, n, alpha) method
 }}}
 Hopefully my notation is clear

--
Ticket URL: <http://trac.sagemath.org/ticket/9706#comment:115>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.

Reply via email to