A randomized algorithm for the QR decomposition-based approximate SVD

05/19/2023
by   Xiaohui Ni, et al.
0

Matrix decomposition is a very important mathematical tool in numerical linear algebra for data processing. In this paper, we introduce a new randomized matrix decomposition algorithm, which is called randomized approximate SVD based on Qatar Riyal decomposition (RCSVD-QR). Our method utilize random sampling and the OR decomposition to address a serious bottlenck associated with classical SVD. RCSVD-QR gives satisfactory convergence speed as well as accuracy as compared to those state-of-the-art algorithms. In addition, we provides an estimate for the expected approximation error in Frobenius norm. Numerical experiments verify these claims.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2018

Subspace-Orbit Randomized Decomposition for Low-rank Matrix Approximation

An efficient, accurate and reliable approximation of a matrix by one of ...
research
03/07/2023

Randomized Symplectic Model Order Reduction for Hamiltonian Systems

Simulations of large scale dynamical systems in multi-query or real-time...
research
08/07/2019

Faster Tensor Train Decomposition for Sparse Data

In recent years, the application of tensors has become more widespread i...
research
03/05/2020

Straggler Robust Distributed Matrix Inverse Approximation

A cumbersome operation in numerical analysis and linear algebra, optimiz...
research
06/30/2022

Randomized K-FACs: Speeding up K-FAC with Randomized Numerical Linear Algebra

K-FAC is a successful tractable implementation of Natural Gradient for D...
research
11/22/2021

A Novel Randomized XR-Based Preconditioned CholeskyQR Algorithm

CholeskyQR is a simple and fast QR decomposition via Cholesky decomposit...
research
02/16/2022

Improved analysis of randomized SVD for top-eigenvector approximation

Computing the top eigenvectors of a matrix is a problem of fundamental i...

Please sign up or login with your details

Forgot password? Click here to reset