Fast Algorithms for Displacement and Low-Rank Structured Matrices

TL;DR

This tutorial introduces fast matrix algorithms leveraging displacement and low-rank structures, enabling efficient computations for structured matrices across various applications.

Contribution

It provides a comprehensive overview of algorithms exploiting displacement and low-rank properties for structured matrices, highlighting recent advances.

Findings

Enhanced computational efficiency for structured matrices

Unified framework for displacement and low-rank algorithms

Potential applications in large-scale scientific computing

Abstract

This tutorial provides an introduction to the development of fast matrix algorithms based on the notions of displacement and various low-rank structures.