Polynomial coefficients from a Chebyshev fit. Given a coefficient array c[0..n-1], this routine returns a coefficient array d[0..n-1] such that sum(k=0,n-1)dky^k = sum(k=0,n-1)Tk(y)-c0/2. The method is Clenshaw's recurrence (5.8.11), but now applied algebraically rather than arithmetically.
@param m
@return
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.