You are here |
matheuscmss.wordpress.com | ||
| | | |
almostsuremath.com
|
|
| | | | In today's post, I investigate a simple recurrence relation and show how it is possible to describe its behaviour asymptotically at large times. The relation describing how the series evolves at a time n will depend both on its value at the earlier time n/2 and on whether n is even or odd, which, as... | |
| | | |
terrytao.wordpress.com
|
|
| | | | A key theme in real analysis is that of studying general functions $latex {f: X \rightarrow {\bf R}}&fg=000000$ or $latex {f: X \rightarrow {\bf C}}&fg=000000$ by first approximating them b | |
| | | |
lucatrevisan.wordpress.com
|
|
| | | | A question that I am very interested in is whether it is possible to study hypergraphs with techniques that are in the spirit of spectral graph theory. It is generally possible to ``flatten'' the adjacency tensor of a hypergraph into a matrix, especially if the hypergraph is $latex {k}&fg=000000$-uniform with $latex {k}&fg=000000$ even, and spectral... | |
| | | |
nhigham.com
|
|
| | A Householder matrix is an $latex n\times n$ orthogonal matrix of the form $latex \notag P = I - \displaystyle\frac{2}{v^Tv} vv^T, \qquad 0 \ne v \in\mathbb{R}^n. $ It is easily verified that $LATEX P$ is orthogonal ($LATEX P^TP = I$), symmetric ($LATEX P^T = P$), involutory ($LATEX P^2 = I$ that is, $LATEX P$ is... |