Explore >> Select a destination
|
You are here 
|
blog.paulhankin.net | ||
| | | | |
fredrikj.net
|
|
| | | | | ||
| | | | |
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). | |
| | | | |
raganwald.com
|
|
| | | | | ||
| | | | |
blog.apaonline.org
|
|
| | | "[C]onfusion about the foundations of the subject is responsible, in my opinion, for much of the misuse of the statistics that one meets in fields of application such as medicine, psychology, sociology, economics, and so forth." (George Barnard 1985, p. 2) "Relevant clarifications of the nature and roles of statistical evidence in scientific research may | ||
