|
You are here |
pfzhang.wordpress.com | ||
| | | | |
mikespivey.wordpress.com
|
|
| | | | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | |
| | | | |
stephenmalina.com
|
|
| | | | | Selected Exercises # 5.A # 12. Define $ T \in \mathcal L(\mathcal P_4(\mathbf{R})) $ by $$ (Tp)(x) = xp'(x) $$ for all $ x \in \mathbf{R} $. Find all eigenvalues and eigenvectors of $ T $. Observe that, if $ p = a_0 + a_1 x + a_2 x^2 + a_3 x^3 + a_4 x^4 $, then $$ x p'(x) = a_1 x + 2 a_2 x^2 + 3 a_3 x^3 + 4 a_4 x^4. | |
| | | | |
algorithmsoup.wordpress.com
|
|
| | | | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | |
| | | | |
thenumb.at
|
|
| | | [AI summary] This text provides a comprehensive overview of differentiable programming, focusing on its application in machine learning and image processing. It explains the fundamentals of automatic differentiation, including forward and backward passes, and demonstrates how to implement these concepts in a custom framework. The text also discusses higher-order differentiation and its implementation in frameworks like JAX and PyTorch. A practical example is given using differentiable programming to de-blur an image, showcasing how optimization techniques like gradient descent can be applied to solve real-world problems. The text emphasizes the importance of differentiable programming in enabling efficient and flexible computation for various domains, includ... | ||