Seminar, Hosted by Institute for Computational and Experimental Research in Mathematics (ICERM), Brown University
Fast randomized algorithms for structured matrices
Abstract
Per-Gunnar Martinsson presents randomized black-box algorithms that compress rank-structured matrices, including H-matrices and HSS matrices, into data-sparse representations. Access is through matrix-vector products, which suits Schur-complement construction and matrix multiplication. When both the operator and its transpose admit O(N) application, the overall compression can also have linear complexity. A featured method combines compression and factorization of an H-matrix under strong admissibility.
Topics
- randomized black-box algorithms, broader topic: algorithms
- rank-structured matrices, search World Wide
- H-matrices, search World Wide
- HSS matrices, search World Wide
- data-sparse representations, broader topic: representations
- matrix-vector products
- Schur-complement construction, search World Wide
- matrix multiplication
- linear complexity, broader topic: Complexity
- strong admissibility, search World Wide