Explore >> Select a destination
|
You are here 
|
datagenetics.com | ||
| | | | |
isaacslavitt.com
|
|
| | | | | ||
| | | | |
www.datagenetics.com
|
|
| | | | | Mathematical Analysis of Battleship | |
| | | | |
freerangestats.info
|
|
| | | | | When playing Snakes and Ladders with the common rules actually used, it is more complex than a simple mathematical model; I simulate games and put forward some findings that could be useful in a future high stakes Snakes and Ladders game. | |
| | | | |
djalil.chafai.net
|
|
| | | Let $X$ be an $n\times n$ complex matrix. The eigenvalues $\lambda_1(X), \ldots, \lambda_n(X)$ of $X$ are the roots in $\mathbb{C}$ of its characteristic polynomial. We label them in such a way that $\displaystyle |\lambda_1(X)|\geq\cdots\geq|\lambda_n(X)|$ with growing phases. The spectral radius of $X$ is $\rho(X):=|\lambda_1(X)|$. The singular values $\displaystyle s_1(X)\geq\cdots\geq s_n(X)$ of $X$ are the eigenvalues of the positive semi-definite Hermitian... | ||
