/explore
|
You are here 
|
theorydish.blog | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
almostsuremath.com
The aim of this post is to motivate the idea of representing probability spaces as states on a commutative algebra. We will consider how this abstract construction relates directly to classical probabilities. In the standard axiomatization of probability theory, due to Kolmogorov, the central construct is a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$. This consists... |
|
| | | | | ||
| | | | |
terrytao.wordpress.com
A key theme in real analysis is that of studying general functions $latex {f: X \rightarrow {\bf R}}&fg=000000$ or $latex {f: X \rightarrow {\bf C}}&fg=000000$ by first approximating them b |
|
| | | | | ||
| | | | |
alanrendall.wordpress.com
In a previous post I discussed the Brouwer fixed point theorem and I mentioned the fact that it applies to any non-empty closed bounded convex subset of a Euclidean space, since a subset of this kind is homeomorphic to a closed ball in a Euclidean space. However I did not prove the latter statement. I... |
|
| | | |||
