Seminar, Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Structured Matrix Approximations via Tensor Decompositions
Abstract
Misha Kilmer develops structured matrix approximation by an invertible matrix-to-tensor transformation, tensor approximation, and a mapping back to matrix space. Different tensor decompositions yield sums of structured Kronecker products, block low-rank matrices, or combinations of both. The framework exposes latent operator structure useful for large computations, and the talk considers where randomization could help. Joint work with Arvind Saibaba at North Carolina State University.
Topics
- structured matrix approximation, search World Wide
- matrix-to-tensor transformation, search World Wide
- tensor approximation, search World Wide
- tensor decompositions
- structured Kronecker products, broader topic: products
- block low-rank matrices, search World Wide
- latent operator structure, search World Wide
- randomization, search World Wide