/explore
|
You are here 
|
www.ethanepperly.com | ||
| | | | |
thenumb.at
|
|
| | | | | [AI summary] The text discusses the representation of functions as vectors and their applications in various domains such as signal processing, geometry, and physics. It explains how functions can be treated as vectors in a vector space, leading to the concept of eigenfunctions and eigenvalues, which are crucial for understanding and manipulating signals and geometries. The text also covers different types of Laplacians, including the standard Laplacian, higher-dimensional Laplacians, and the Laplace-Beltrami operator, and their applications in fields like image compression, computer graphics, and quantum mechanics. The discussion includes spherical harmonics, which are used in representing functions on spheres, and their applications in game engines and glo... | |
| | | | |
connorboyle.io
|
|
| | | | | I'm planning to write a series of posts about fast Fourier transform algorithms. This first post covers the Cooley-Tukey algorithm, which is the original and most well-known FFT algorithm. | |
| | | | |
liorsinai.github.io
|
|
| | | | | A detailed foundation of quaternion mathematics. | |
| | | | |
nickhar.wordpress.com
|
|
| | | 1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B... | ||
