/explore
|
You are here 
|
nuxx.net | ||
| | | | |
djalil.chafai.net
|
|
| | | | | Charles E. Porter was one of the first to use computers to study the eigenvalues and eigenvectors of random matrices. Here is a PDF file of his article entitled Random Matrix Diagonalization - Some Numerical Computations, published in Journal of Mathematical Physics 4, 1039 (1963). Here is also the PDF file of the detailed programs, written in collaboration with K.... | |
| | | | |
djalil.chafai.net
|
|
| | | | | In this short post, we recall the pleasant notion of Fréchet mean (or Karcher mean) of a probability measure on a metric space, a concept already considered in an old previous post. Let \( {(E,d)} \) be a metric space, such as a graph (with vertices and edges) or a Riemannian manifold, equipped with its Borel \( {\sigma} \)-field. Let... | |
| | | | |
djalil.chafai.net
|
|
| | | | | The success of computers is largely due to the existence of efficient algorithms for solving numerical and combinatorial problems. These algorithms are used billion of times per second. Many users (even among scientists) do not know them. One may find a list of algorithms on Wikipedia. Depending on your tastes, you may distinguish some favorite ones, for their simplicity, elegance,... | |
| | | | |
rapuran.wordpress.com
|
|
| | | More on Weekly Travel Theme | ||
