Explore >> Select a destination
|
You are here 
|
nhigham.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). | |
| | | | |
johncarlosbaez.wordpress.com
|
|
| | | | | Our 6-week Edinburgh meeting for creating category-based software for agent-based models is done, yet my collaborators are still busy improving and expanding this software. I want to say more about how it works. I have a lot of catching up to do! Today I mainly want to announce that Kris Brown has made a great... | |
| | | | |
ryxcommar.com
|
|
| | | | | Update: The code for these animations is available here. Another Update: I think some of the explanations on this page may be helped with more colors. I have some updated visuals here that include colors. The Frisch-Waugh-Lovell theorem states that within a multivariate regression on $latex x_1$ and $latex x_2$, the coefficient for $latex x_2$,... | |
| | | | |
cosmiaineurope.wordpress.com
|
|
| | | Cosmia's travel in Europe from June 2018 to July 2018 | ||
