Back to search

University of Washington

Lanczos-based methods for matrix functions

Abstract

dc:description.abstract

We study Lanczos-based methods for tasks involving matrix functions. We begin by resurfacing a range of ideas regarding matrix-free quadrature which, to the best of our knowledge, have not been treated simultaneously. This enables the development of a unified perspective from which a number of commonly used randomized methods for spectrum and spectral sum approximation can be understood. We proceed to develop optimal Krylov subspace methods for approximating the product of a rational matrix function with a fixed vector. Finally, we show how the optimality of such methods can be used to obtain fine-grained spectrum dependent bounds for standard Lanczos-based methods for approximating a wide class of matrix functions applied to a vector.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Chen, Tyler
Advisors dc:contributor.advisor
  • Greenbaum, Anne
  • Trogdon, Thomas

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • CC BY-SA
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1773/49249

Chain of custody

source
Harvested from
University of Washington
Base URL
digital.lib.washington.edu/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Chen, Tyler. Lanczos-based methods for matrix functions. 2022. http://hdl.handle.net/1773/49249