The Parks-McClellan algorithm and Chebyshev-proxy root finding methods Silviu Filip N. Brisebarre and G. Hanrot (AriC, LIP, ENS Lyon) - Root-finding algorithm - Document - PDFSEARCH.IO

First Page	Meta Content
	The Parks-McClellan algorithm and Chebyshev-proxy root finding methods Silviu Filip N. Brisebarre and G. Hanrot (AriC, LIP, ENS Lyon) Add to Reading List Document Date: 2015-05-28 03:24:02 Open Document File Size: 1,01 MB Share Result on Facebook

The Parks-McClellan algorithm and Chebyshev-proxy root finding methods Silviu Filip N. Brisebarre and G. Hanrot (AriC, LIP, ENS Lyon)Add to Reading List