Explore >> Select a destination
|
You are here 
|
nhigham.com | ||
| | | | |
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... | |
| | | | |
jkmsmkj.fyi
|
|
| | | | | You should have come from here! Here's a quickie: What are the eigenvalues of a 2D rotation matrix? Here's a problem: For a bunch of rotations performed one after another on a 3D object, find an equivalent single rotation which would give the same result. Here's a solution: First of all, multiply all the rotation... | |
| | | | |
francisbach.com
|
|
| | | | | ||
| | | | |
gereshes.com
|
|
| | | This post is focused on presenting the basics of stability for dynamical systems, and answers what will our system do if we perturb it a small amount? | ||
