/explore
|
You are here 
|
nickhar.wordpress.com | ||
| | | | |
theoryofcomputing.org
|
|
| | | | | ||
| | | | |
mycqstate.wordpress.com
|
|
| | | | | Today I'd like to sketch a question that's been pushing me in a lot of different directions over the past few years --- some sane, others less so; few fruitful, but all instructive. The question is motivated by the problem of placing upper bounds on the amount of entanglement needed to play a two-player non-local... | |
| | | | |
tiao.io
|
|
| | | | | Suppose we're given a positive semidefinite (PSD) matrix $\mathbf{A} \in \mathbb{R}^{N \times N}$ to which we wish to update by some low-rank matrix $\mathbf{U} \mathbf{U}^\top \in \mathbb{R}^{N \times N}$, $$\mathbf{B} \triangleq \mathbf{A} + \mathbf{U} \mathbf{U}^\top,$$ where the update factor matrix $\mathbf{U} \in \mathbb{R}^{N \times M}$. To be more precise, the low-rank update is rank-$M$ for some $M \ll N$. What is the best way to calculate the Cholesky decomposition of $\mathbf{B}$? Given ...... | |
| | | | |
www.jerpint.io
|
|
| | | A collection of anything and everything. | ||
