{numerical-linear-algebra} questions involving algorithms for linear algebra computations.

**27**

votes

**9**answers

12k views

### Fast Matrix Multiplication

Suppose we have two $n$ by $n$ matrices over particular ring. We want to multiply them as fast as possible. According to wikipedia there is an algorithm of Coppersmith and Winograd that can do it in ...

**8**

votes

**1**answer

248 views

### Efficiently compute the trace of a sparse matrix times the inverse of a sparse matrix?

How can I efficiently compute
$\mathrm{trace}(A(B^{-1}))$
where $A$ and $B$ are both sparse symmetric PSD $n \times n$ matrices, both with $O(n)$ non-zero entries? If it helps, the pattern of ...

**7**

votes

**1**answer

168 views

### Compute only selected components of an eigenvector

I am wondering whether it is possible to compute portions of the eigenvectors of a given (possibly very big) matrix. More formally, consider the eigenvalue problem $\mathbf{Ax} = \lambda \mathbf{x}$, ...

**7**

votes

**1**answer

599 views

### The singular values of the Hilbert matrix

The $n\times n$ Hilbert matrix $H$ is defined as
$H_{ij} = \frac{1}{i+j-1}, \qquad 1\leq i,j\leq n$
What is known about the singular values $\sigma_1\geq\ldots\geq \sigma_n$ of $H$?
For example, ...

**5**

votes

**3**answers

271 views

### Norm of triangular truncation operator on rank deficient matrices

Let $T_{n\times n}$ be a triangular truncation matrix, i.e.
$$T_{i,j}=\begin{cases}1 & i\ge j\\ 0 & i<j \end{cases}$$
It is known that for arbitrary $A_{n\times n}$
$$\|T\circ ...