Back to search

Michigan Technological University

Sub-Sampled Matrix Approximations

Abstract

dc:description.abstract

Matrix approximations are widely used to accelerate many numerical algorithms. Current methods sample row (or column) spaces to reduce their computational footprint and approximate a matrix A with an appropriate embedding of the data sampled. This work introduces a novel family of randomized iterative algorithms which use significantly less data per iteration than current methods by sampling input and output spaces simultaneously. The data footprint of the algorithms can be tuned (independent of the underlying matrix dimension) to available hardware. Proof is given for the convergence of the algorithms, which are referred to as sub-sampled, in terms of numerically tested error bounds. A heuristic accelerated scheme is developed and compared to current algorithms on a substantial test-suite of matrices. The sub-sampled algorithms provide a lightweight framework to construct more useful inverse and low rank matrix approximations. Modifying the sub-sampled algorithms gives families of methods which iteratively approximate the inverse of a matrix whose accelerated variant is comparable to current state of the art methods. Inserting a compression step in the algorithms gives low rank approximations having accelerated variants which have fixed computational as well as storage footprints.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy in Mathematical Sciences (PhD)
Level thesis:degree_level
Open Access Dissertation
Discipline thesis:degree_discipline
Department of Mathematical Sciences

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Azzam, Joy
Committee members dc:contributor.committeemember
  • Cecile Piret
  • Daniel Fuhrmann
Contributors dc:contributor
  • Allan Struthers
  • Benjamin Ong

Subjects

dc:subject × 8

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Michigan Technological University
Base URL
digitalcommons.mtu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Azzam, Joy. Sub-Sampled Matrix Approximations. Open Access Dissertation thesis, https://doi.org/10.37099/mtu.dc.etdr/1002