Continuous analogues of matrix factorizations

50Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Analogues of singular value decomposition (SVD), QR, LU and Cholesky factorizations are presented for problems in which the usual discrete matrix is replaced by a 'quasimatrix', continuous in one dimension, or a 'cmatrix', continuous in both dimensions. Two challenges arise: the generalization of the notions of triangular structure and row and column pivoting to continuous variables (required in all cases except the SVD, and far from obvious), and the convergence of the infinite series that define the cmatrix factorizations. Our generalizations of triangularity and pivoting are based on a new notion of a 'triangular quasimatrix'. Concerning convergence of the series, we prove theorems asserting convergence provided the functions involved are sufficiently smooth.

Cite

CITATION STYLE

APA

Townsend, A., & Trefethen, L. N. (2015). Continuous analogues of matrix factorizations. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 471(2173). https://doi.org/10.1098/rspa.2014.0585

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free