Explore >> Select a destination
|
You are here 
|
jrhawley.ca | ||
| | | | |
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... | |
| | | | |
algassert.com
|
|
| | | | | Craig Gidney's computer science blog | |
| | | | |
jaykmody.com
|
|
| | | | | Efficiently computing distances matrixes in NumPy. | |
| | | | |
0fps.net
|
|
| | | Last time, we showed how one can use symmetric tensors to conveniently represent homogeneous polynomials and Taylor series. Today, I am going to talk about how to actually implement a generic homogeneous polynomial/symmetric tensor class in C++. The goal of this implementation (for the moment) is not efficiency, but rather generality and correctness. If there... | ||
