Tensor structured linear operators play an important role in matrix equations and low-rank modelling. Motivated by this we consider the problem of approximating a matrix by a sum of Kronecker products. It is known that an optimal approximation in Frobenius norm can be obtained from the singular value decomposition of a rearranged matrix, but when the goal is to approximate the matrix as a linear map, an operator norm would be a more appropriate error measure. We present an alternating optimization approach for the corresponding approximation problem in spectral norm that is based on semidefinite programming, and report on its practical performance for small examples.
This is joint work with Venkat Chandrasekaran and Mareike Dressler.

That the linear systems arising upon the discretization of elliptic PDEs can be solved efficiently is well-known, and iterative solvers that often attain linear complexity (multigrid, Krylov methods, etc) have proven very successful. Interestingly, it has recently been demonstrated that it is often possible to directly compute an approximate inverse to the coefficient matrix in linear (or close to linear) time. The talk will argue that such direct solvers have several compelling qualities, including improved stability and robustness, the ability to solve certain problems that have remained intractable to iterative methods, and dramatic improvements in speed in certain environments.

After a general introduction to the field, particular attention will be paid to a set of recently developed randomized algorithms that construct data sparse representations of large dense matrices that arise in scientific computations. These algorithms are entirely black box, and interact with the linear operator to be compressed only via the matrix-vector multiplication.

In this talk, I will introduce the BPS cohomology of the moduli space of Higgs bundles on a smooth projective curve of rank r and degree d using cohomological Donaldson-Thomas theory. The BPS cohomology and the intersection cohomology coincide when r and d are coprime, but they are different in general. We will see that the BPS cohomology does not depend on d. This is a generalization of the Hausel-Thaddeus conjecture to non-coprime case. I will also explain that Toda's χ-independence conjecture (and hence the strong rationality conjecture) for local curves can be proved in the same manner. This talk is based on a joint work with Naoki Koseki and another joint work with Naruki Masuda.