Precision-induced Adaptive Randomized Low-Rank Approximation for SVD and Matrix Inversion

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Xu, Weiwei, Shen, Weijie, Bai, Zhengjian, Xu, Chen
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912851966296064
author Xu, Weiwei
Shen, Weijie
Bai, Zhengjian
Xu, Chen
author_facet Xu, Weiwei
Shen, Weijie
Bai, Zhengjian
Xu, Chen
contents Singular value decomposition (SVD) and matrix inversion are ubiquitous in scientific computing. Both tasks are computationally demanding for large scale matrices. Existing algorithms can approximatively solve these problems with a given rank, which however is unknown in practice and requires considerable cost for tuning. In this paper, we tackle the SVD and matrix inversion problems from a new angle, where the optimal rank for the approximate solution is explicitly guided by the distribution of the singular values. Under the framework, we propose a precision-induced random re-normalization procedure for the considered problems without the need of guessing a good rank. The new algorithms built upon the procedure simultaneously calculate the optimal rank for the task at a desired precision level and lead to the corresponding approximate solution with a substantially reduced computational cost. The promising performance of the new algorithms is supported by both theory and numerical examples.
format Preprint
id arxiv_https___arxiv_org_abs_2601_19250
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Precision-induced Adaptive Randomized Low-Rank Approximation for SVD and Matrix Inversion
Xu, Weiwei
Shen, Weijie
Bai, Zhengjian
Xu, Chen
Numerical Analysis
Singular value decomposition (SVD) and matrix inversion are ubiquitous in scientific computing. Both tasks are computationally demanding for large scale matrices. Existing algorithms can approximatively solve these problems with a given rank, which however is unknown in practice and requires considerable cost for tuning. In this paper, we tackle the SVD and matrix inversion problems from a new angle, where the optimal rank for the approximate solution is explicitly guided by the distribution of the singular values. Under the framework, we propose a precision-induced random re-normalization procedure for the considered problems without the need of guessing a good rank. The new algorithms built upon the procedure simultaneously calculate the optimal rank for the task at a desired precision level and lead to the corresponding approximate solution with a substantially reduced computational cost. The promising performance of the new algorithms is supported by both theory and numerical examples.
title Precision-induced Adaptive Randomized Low-Rank Approximation for SVD and Matrix Inversion
topic Numerical Analysis
url https://arxiv.org/abs/2601.19250