A theory of meta-factorization

11/29/2021
by   Michał P. Karpowicz, et al.
0

This paper introduces meta-factorization, a theory that describes matrix decompositions as solutions of linear matrix equations: the projector and the reconstruction equation. Meta-factorization reconstructs known factorizations, reveals their internal structures, and allows for introducing modifications, as illustrated with the example of SVD, QR, and UTV factorizations. The prospect of meta-factorization also provides insights into computational aspects of generalized matrix inverses and randomized linear algebra algorithms. The relations between the Moore-Penrose pseudoinverse, generalized Nyström method, and the CUR decomposition are revealed here as an illustration. Finally, meta-factorization offers hints on the structure of new factorizations and provides the potential of creating them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2018

Orbits of monomials and factorization into products of linear forms

This paper is devoted to the factorization of multivariate polynomials i...
research
04/18/2021

Fifty Three Matrix Factorizations: A systematic approach

The success of matrix factorizations such as the singular value decompos...
research
03/13/2023

CPQR-based randomized algorithms for generalized CUR decompositions

Based on the column pivoted QR decomposition, we propose some randomized...
research
11/30/2018

On least squares problems with certain Vandermonde--Khatri--Rao structure with applications to DMD

This paper proposes a new computational method for solving structured le...
research
09/14/2019

A Generalized Randomized Rank-Revealing Factorization

We introduce a Generalized Randomized QR-decomposition that may be appli...
research
07/02/2020

GSoFa: Scalable Sparse LU Symbolic Factorization on GPUs

Decomposing a matrix A into a lower matrix L and an upper matrix U, whic...

Please sign up or login with your details

Forgot password? Click here to reset