/explore
|
You are here 
|
www.ethanepperly.com | ||
| | | | |
fa.bianp.net
There's a fascinating link between minimization of quadratic functions and polynomials. A link that goes deep and allows to phrase optimization problems in the language of polynomials and vice versa. Using this connection, we can tap into centuries of research in the theory of polynomials and shed new light on ... |
|
| | | | | ||
| | | | |
mcyoung.xyz
[AI summary] This text provides an in-depth explanation of linear algebra concepts, including vector spaces, linear transformations, matrix multiplication, and field extensions. It emphasizes the importance of understanding these concepts through the lens of linear maps and their composition, which naturally leads to the matrix multiplication formula. The text also touches on the distinction between vector spaces and abelian groups, and discusses the concept of field extensions, such as [R:Q] and [C:R]. The author mentions their art blog and acknowledges their own drawing of the content. |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
liorsinai.github.io
A series on automatic differentiation in Julia. Part 1 provides an overview and defines explicit chain rules. |
|
| | | |||
