/explore
|
You are here 
|
blog.paulhankin.net | ||
| | | | |
raganwald.com
|
|
| | | | | ||
| | | | |
www.jeremykun.com
Problem: Compute the product of two polynomials efficiently. Solution: import numpy from numpy.fft import fft, ifft def poly_mul(p1, p2): """Multiply two polynomials. p1 and p2 are arrays of coefficients in degree-increasing order. """ deg1 = p1.shape[0] - 1 deg2 = p1.shape[0] - 1 # Would be 2*(deg1 + deg2) + 1, but the next-power-of-2 handles the +1 total_num_pts = 2 * (deg1 + deg2) next_power_of_2 = 1 << (total_num_pts - 1). |
|
| | | | | ||
| | | | |
www.haskellforall.com
fibonacci This post illustrates a nifty application of Haskell's standard library to solve a numeric problem. The Fi... |
|
| | | | | ||
| | | | |
caitlinsanswersforhumanitiesclass.wordpress.com
This is the excerpt for your very first post. |
|
| | | |||
