Explore >> Select a destination
|
You are here 
|
qchu.wordpress.com | ||
| | | | |
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... | |
| | | | |
fabricebaudoin.blog
|
|
| | | | | In this section, we consider a diffusion operator $latex L=\sum_{i,j=1}^n \sigma_{ij} (x) \frac{\partial^2}{ \partial x_i \partial x_j} +\sum_{i=1}^n b_i (x)\frac{\partial}{\partial x_i}, $ where $latex b_i$ and $latex \sigma_{ij}$ are continuous functions on $latex \mathbb{R}^n$ and for every $latex x \in \mathbb{R}^n$, the matrix $latex (\sigma_{ij}(x))_{1\le i,j\le n}$ is a symmetric and non negative matrix. Our... | |
| | | | |
nickhar.wordpress.com
|
|
| | | | | 1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B... | |
| | | | |
richardzach.org
|
|
| | | The Zeitschrift für mathematische Logik und Grundlagen der Mathematik was one of the few logic journals around in the mid 20th century. It started publishing in 1955, I think the only logic journal... | ||
