Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
thenumb.at
|
|
| | | | | [AI summary] This text provides an in-depth exploration of how functions can be treated as vectors, particularly in the context of signal and geometry processing. It discusses the representation of functions as infinite-dimensional vectors, the use of Fourier transforms in various domains (such as 1D, spherical, and mesh-based), and the application of linear algebra to functions for tasks like compression and smoothing. The text also touches on the mathematical foundations of these concepts, including the Laplace operator, eigenfunctions, and orthonormal bases. It concludes with a list of further reading topics and acknowledges the contributions of reviewers. | |
| | | | |
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. | |
| | | | |
lucatrevisan.wordpress.com
|
|
| | | | | In which we show how to find the eigenvalues and eigenvectors of Cayley graphs of Abelian groups, we find tight examples for various results that we proved in earlier lectures, and, along the way, we develop the general theory of harmonic analysis which includes the Fourier transform of periodic functions of a real variable, the... | |
| | | | |
almostsuremath.com
|
|
| | | Given a sequence $latex {X_1,X_2,\ldots}&fg=000000$ of real-valued random variables defined on a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$, it is a standard result that the supremum $latex \displaystyle \setlength\arraycolsep{2pt} \begin{array}{rl} &\displaystyle X\colon\Omega\rightarrow{\mathbb R}\cup\{\infty\},\smallskip\\ &\displaystyle X(\omega)=\sup_nX_n(\omega). \end{array} &fg=000000$ is measurable. To ensure that this is well-defined, we need to allow X to have values in $latex... | ||
