Date
Tue, 10 May 2016
14:30
Location
L5
Speaker
Nick Trefethen
Organisation
University of Oxford

Low-rank compression of matrices and tensors is a huge and growing business.  Closely related is low-rank compression of multivariate functions, a technique used in Chebfun2 and Chebfun3.  Not all functions can be compressed, so the question becomes, which ones?  Here we focus on two kinds of functions for which compression is effective: those with some alignment with the coordinate axes, and those dominated by small regions of localized complexity.

 

Please contact us with feedback and comments about this page. Last updated on 03 Apr 2022 01:32.