Weiwei Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Weiwei Xu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
Weijie Shen
School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing, China
5 shared publications- Zheng-Jian Bai
School of Mathematical Sciences, Xiamen University, Xiamen, People’s Republic of China
3 shared publications Chen Xu
School of Mathematics and Statistics Nanjing University of Information Science and Technology 210044 Nanjing P. R. China
2 shared publications- Bo Fu
School of Mathematics and Statistics, Xi’an Jiaotong University, Shaanxi, China
1 shared publication - Chang Liu
School of Mathematics and Statistics Jiangsu Normal University 221116 Xuzhou P.R. China
1 shared publication - Dandan Jiang
School of Mathematics and Statistics, Xi’an Jiaotong University, Shaanxi, China
1 shared publication
Latest Publications
- 22 July 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 108 (3) , 82
Accelerating Randomized Algorithms for Low-Rank Matrix Approximation
- 22 July 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 108 (3) , 82
Accelerating Randomized Algorithms for Low-Rank Matrix Approximation
- 27 March 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 49
Fast Randomized Algorithms for Low-Rank Matrix Approximations for Generalized Singular Value Decomposition with Applications
- 27 March 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 49
Fast Randomized Algorithms for Low-Rank Matrix Approximations for Generalized Singular Value Decomposition with Applications
- Open Access
Precision-induced Adaptive Randomized Low-Rank Approximation for SVD and Matrix Inversion
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.
Open AccessPrecision-induced Adaptive Randomized Low-Rank Approximation for SVD and Matrix Inversion
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.
- Open Access
A Novel Adaptive Low-Rank Matrix Approximation Method for Image Compression and Reconstruction
Low-rank matrix approximation plays an important role in various applications such as image processing, signal processing and data analysis. The existing methods require a guess of the ranks of matrices that represent images or involve additional costs to determine the ranks. A novel efficient orthogonal decomposition with automatic basis extraction (EOD-ABE) is proposed to compute the optimal low-rank matrix approximation with adaptive identification of the optimal rank. By introducing a randomized basis extraction mechanism, EOD-ABE eliminates the need for additional rank determination steps and can compute a rank-revealing approximation to a low-rank matrix. With a computational complexity of $O(mnr)$, where $m$ and $n$ are the dimensions of the matrix and $r$ is its rank, EOD-ABE achieves significant speedups compared to the state-of-the-art methods. Experimental results demonstrate the superior speed, accuracy and robustness of EOD-ABE and indicate that EOD-ABE is a powerful tool for fast image compression and reconstruction and hyperspectral image dimensionality reduction in large-scale applications.Open AccessA Novel Adaptive Low-Rank Matrix Approximation Method for Image Compression and Reconstruction
Low-rank matrix approximation plays an important role in various applications such as image processing, signal processing and data analysis. The existing methods require a guess of the ranks of matrices that represent images or involve additional costs to determine the ranks. A novel efficient orthogonal decomposition with automatic basis extraction (EOD-ABE) is proposed to compute the optimal low-rank matrix approximation with adaptive identification of the optimal rank. By introducing a randomized basis extraction mechanism, EOD-ABE eliminates the need for additional rank determination steps and can compute a rank-revealing approximation to a low-rank matrix. With a computational complexity of $O(mnr)$, where $m$ and $n$ are the dimensions of the matrix and $r$ is its rank, EOD-ABE achieves significant speedups compared to the state-of-the-art methods. Experimental results demonstrate the superior speed, accuracy and robustness of EOD-ABE and indicate that EOD-ABE is a powerful tool for fast image compression and reconstruction and hyperspectral image dimensionality reduction in large-scale applications. - 19 March 2025
- Published by Springer Nature in Computational Statistics
- Vol. 40 (8) , 4187-4207
An improved preconditioned unsupervised K-means clustering algorithm
- 19 March 2025
- Published by Springer Nature in Computational Statistics
- Vol. 40 (8) , 4187-4207
An improved preconditioned unsupervised K-means clustering algorithm
- Open Access
Two-sided uniformly randomized GSVD for large-scale discrete ill-posed problems with Tikhonov regularizations
The generalized singular value decomposition (GSVD) is a powerful tool for solving discrete ill-posed problems. In this paper, we propose a two-sided uniformly randomized GSVD algorithm for solving the large-scale discrete ill-posed problem with the general Tikhonov regularization. Based on two-sided uniform random sampling, the proposed algorithm can improve the efficiency with less computing time and memory requirement and obtain expected accuracy. The error analysis for the proposed algorithm is also derived. Finally, we report some numerical examples to illustrate the efficiency of the proposed algorithm.
Open AccessTwo-sided uniformly randomized GSVD for large-scale discrete ill-posed problems with Tikhonov regularizations
The generalized singular value decomposition (GSVD) is a powerful tool for solving discrete ill-posed problems. In this paper, we propose a two-sided uniformly randomized GSVD algorithm for solving the large-scale discrete ill-posed problem with the general Tikhonov regularization. Based on two-sided uniform random sampling, the proposed algorithm can improve the efficiency with less computing time and memory requirement and obtain expected accuracy. The error analysis for the proposed algorithm is also derived. Finally, we report some numerical examples to illustrate the efficiency of the proposed algorithm.
- Open Access
Efficient Orthogonal Decomposition with Automatic Basis Extraction for Low-Rank Matrix Approximation
Low-rank matrix approximation play a ubiquitous role in various applications such as image processing, signal processing, and data analysis. Recently, random algorithms of low-rank matrix approximation have gained widespread adoption due to their speed, accuracy, and robustness, particularly in their improved implementation on modern computer architectures. Existing low-rank approximation algorithms often require prior knowledge of the rank of the matrix, which is typically unknown. To address this bottleneck, we propose a low-rank approximation algorithm termed efficient orthogonal decomposition with automatic basis extraction (EOD-ABE) tailored for the scenario where the rank of the matrix is unknown. Notably, we introduce a randomized algorithm to automatically extract the basis that reveals the rank. The efficacy of the proposed algorithms is theoretically and numerically validated, demonstrating superior speed, accuracy, and robustness compared to existing methods. Furthermore, we apply the algorithms to image reconstruction, achieving remarkable results.
Open AccessEfficient Orthogonal Decomposition with Automatic Basis Extraction for Low-Rank Matrix Approximation
Low-rank matrix approximation play a ubiquitous role in various applications such as image processing, signal processing, and data analysis. Recently, random algorithms of low-rank matrix approximation have gained widespread adoption due to their speed, accuracy, and robustness, particularly in their improved implementation on modern computer architectures. Existing low-rank approximation algorithms often require prior knowledge of the rank of the matrix, which is typically unknown. To address this bottleneck, we propose a low-rank approximation algorithm termed efficient orthogonal decomposition with automatic basis extraction (EOD-ABE) tailored for the scenario where the rank of the matrix is unknown. Notably, we introduce a randomized algorithm to automatically extract the basis that reveals the rank. The efficacy of the proposed algorithms is theoretically and numerically validated, demonstrating superior speed, accuracy, and robustness compared to existing methods. Furthermore, we apply the algorithms to image reconstruction, achieving remarkable results.
- 16 February 2024
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (349) , 2331-2359
Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: A geometric method
In this paper, we consider the problem of computing an arbitrary generalized singular value of a Grassman or real matrix pair and a triplet of associated generalized singular vectors. Based on the QR factorization, the problem is reformulated as two novel trace maximization problems, each of which has double variables with unitary constraints or orthogonal constraints. Theoretically, we show that the arbitrarily prescribed extreme generalized singular values and associated triplets of generalized singular vectors can be determined by the global solutions of the constrained trace optimization problems. Then we propose a geometric inexact Newton–conjugate gradient (Newton-CG) method for solving their equivalent trace minimization problems over the Riemannian manifold of all fixed-rank partial isometries. The proposed method can extract not only the prescribed extreme generalized singular values but also associated triplets of generalized singular vectors. Under some mild assumptions, we establish the global and quadratic convergence of the proposed method. Finally, numerical experiments on both synthetic and real data sets show the effectiveness and high accuracy of our method.
- 16 February 2024
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 93 (349) , 2331-2359
Double-variable trace maximization for extreme generalized singular quartets of a matrix pair: A geometric method
In this paper, we consider the problem of computing an arbitrary generalized singular value of a Grassman or real matrix pair and a triplet of associated generalized singular vectors. Based on the QR factorization, the problem is reformulated as two novel trace maximization problems, each of which has double variables with unitary constraints or orthogonal constraints. Theoretically, we show that the arbitrarily prescribed extreme generalized singular values and associated triplets of generalized singular vectors can be determined by the global solutions of the constrained trace optimization problems. Then we propose a geometric inexact Newton–conjugate gradient (Newton-CG) method for solving their equivalent trace minimization problems over the Riemannian manifold of all fixed-rank partial isometries. The proposed method can extract not only the prescribed extreme generalized singular values but also associated triplets of generalized singular vectors. Under some mild assumptions, we establish the global and quadratic convergence of the proposed method. Finally, numerical experiments on both synthetic and real data sets show the effectiveness and high accuracy of our method.
- Open Access
- 25 March 2023
- Published by Oxford University Press (OUP) in National Science Review
- Vol. 10 (6) , nwad083
Fast algorithms for singular value decomposition and the inverse of nearly low-rank matrices
This perspective focuses on the fast algorithm design for singular value decomposition and inverse computation of nearly low-rank matrices that are potentially of big sizes.
- 25 March 2023
- Published by Oxford University Press (OUP) in National Science Review
- Vol. 10 (6) , nwad083
Open AccessFast algorithms for singular value decomposition and the inverse of nearly low-rank matrices
This perspective focuses on the fast algorithm design for singular value decomposition and inverse computation of nearly low-rank matrices that are potentially of big sizes.
- 1 January 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (2) , 1-22
A New Matrix Maximization Model for Computing Ratios of Generalized Singular Values from High-Order GSVD
- 1 January 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 94 (2) , 1-22
A New Matrix Maximization Model for Computing Ratios of Generalized Singular Values from High-Order GSVD