Explore >> Select a destination
|
You are here 
|
nhigham.com | ||
| | | | |
a.skh.am
|
|
| | | | | I recently started playing around with SymPy as a kind of local alternative to the increasingly frustrating Wolfram Alpha, and found an ergonomic way to interact with it inside org-mode using Babel to get pretty live-previews of the equations being produced. | |
| | | | |
opguides.info
|
|
| | | | | 6 - Matrix Theory / Linear Algebra # Below is a 15 video series that totals a bit under 3 hours. Interactive Linear Algebra, text book that actually uses the web Linear Algebra Done Wrong - Sergei Treil @ Brown University Matrices, Diagrammatically Linear Algebra - Jim Hefferson Linear Algebra and Applications: An Inquiry-Based Approach | |
| | | | |
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). | |
| | | | |
nitens.org
|
|
| | | |||
