/explore
|
You are here 
|
blog.georgeshakan.com | ||
| | | | |
nhigham.com
|
|
| | | | | A norm on $latex \mathbb{C}^{m \times n}$ is unitarily invariant if $LATEX \|UAV\| = \|A\|$ for all unitary $latex U\in\mathbb{C}^{m \times m}$ and $latex V\in\mathbb{C}^{n\times n}$ and for all $latex A\in\mathbb{C}^{m \times n}$. One can restrict the definition to real matrices, though the term unitarily invariant is still typically used. Two widely used matrix norms... | |
| | | | |
lucatrevisan.wordpress.com
|
|
| | | | | Welcome to phase two of in theory, in which we again talk about math. I spent last Fall teaching two courses and getting settled, I mostly traveled in January and February, and I have spent the last two months on my sofa catching up on TV series. Hence I will reach back to last Spring,... | |
| | | | |
nhigham.com
|
|
| | | | | In many applications a matrix $latex A\in\mathbb{R}^{m\times n}$ has less than full rank, that is, $latex r = \mathrm{rank}(A) < \min(m,n)$. Sometimes, $latex r$ is known, and a full-rank factorization $LATEX A = GH$ with $latex G\in\mathbb{R}^{m \times r}$ and $latex H\in\mathbb{R}^{r \times n}$, both of rank $latex r$, is given-especially when $latex r =... | |
| | | | |
tdhopper.com
|
|
| | | Ten years ago today, John Cook published his first blog post entitled Moore's law and software bloat, a brief observation on how "Software bloat has increased at roughly the same rate as Moore's law".\nSince then, he's written over 2,700 posts (nearly 1 per day) on math, computing, software development, statistics, science, and more. His posts are rarely long, but they always give me something to think about. Over the last six years since I discovered his blog, John has encouraged me to\n | ||
