Trees  Indices  Help 



Virtual base class. This is a superclass of all orthorgonal polynomials. This does the recurrence [Abramowitz and Stegun p.782], and ensures that the generated polynomials are all orthonormal to each other. The derived classed need to specify two functions: recurse() and wt_(). Recurse() is the recursion relation from P(i) and P(i1) to P(i+1), and wt_() is the weighting function for the polynomial. Wt_() is needed to check orthogonality, and really defines the polynomial. These polynomials are guarenteed to be orthogonal to eachother when summed over the supplied set of x points. Thus, if you change x_() or wt_(), you get a different set of functions.
Instance Methods  















Class Variables  
__doc__ = """Virtual base cla


registry = {}
(Inherited from gmisclib.ortho_poly.ortho)

Method Details 
Argument n is how many points you want the polynomials evaluated at. The ordinates of the points are placed in self.x. You may alternatively specify the points as argument x, in which case the x_() function will never be called.

Self.P(i) is the ith orthogonal polynomial. The result is normalized so that numpy.sum(self.P(i)**2) == 1.

Does the recurrence relation, evaluating f_(n+1) as a function of n, f_n, and f_(n1). For n=0 and n=1, fn and fnm1 may be None. 

Class Variable Details 
__doc__

Trees  Indices  Help 


Generated by Epydoc 3.0.1 on Thu Sep 22 04:25:09 2011  http://epydoc.sourceforge.net 