|
You are here |
seanzhang.me | ||
| | | | |
kyunghyuncho.me
|
|
| | | | | ||
| | | | |
nhigham.com
|
|
| | | | | A $latex p$th root of an $latex n\times n$ matrix $LATEX A$ is a matrix $LATEX X$ such that $latex X^p = A$, and it can be written $latex X = A^{1/p}$. For a rational number $latex r = j/k$ (where $latex j$ and $latex k$ are integers), defining $latex A^r$ is more difficult: is... | |
| | | | |
idontgetoutmuch.wordpress.com
|
|
| | | | | Introduction These are some very hasty notes on Runge-Kutta methods and IRK2 in particular. I make no apologies for missing lots of details. I may try and put these in a more digestible form but not today. Some Uncomprehensive Theory In general, an implicit Runge-Kutta method is given by $latex \displaystyle y_{n+1} = y_n +... | |
| | | | |
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... | ||