Zheng-Jian Bai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zheng-Jian Bai has a total of 57 co-authors. Here are the top co-authors by number of shared publications:
- Xiao-Qing Jin
Department of Mathematics, University of Macau, Macao, People’s Republic of China
6 shared publications Zhi Zhao
6 shared publications- Guiyun Xiao
School of Mathematical Sciences, Xiamen University, Xiamen, People’s Republic of China
5 shared publications - Teng-Teng Yao
Department of Mathematics, School of Sciences, Zhejiang University of Science and Technology, Hangzhou, People’s Republic of China
5 shared publications Xiao-Qing Jin
4 shared publications- Zhi Zhao
Department of Mathematics, School of Sciences, Hangzhou Dianzi University, Hangzhou, People’s Republic of China
4 shared publications
Latest Publications
- 19 June 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (3)
Randomized Preconditioned Hard Thresholding Pursuit for Sparse Approximation
Sparsity models with ‐norm constraint are widely used in image processing, statistical regression, wireless communications, and other fields, where numerous thresholding‐based methods are employed. However, when the acquisition of linear measurement is time‐consuming or the measurement matrix is too large to store in memory, many thresholding‐based methods that require the whole measurement matrix become impractical. To address this issue, we propose a randomized preconditioned hard thresholding pursuit algorithm for finding a sparse solution to a linear system of equations with ‐norm constraint. The proposed method is also applicable to general settings. It is well‐known that Gaussian random matrices satisfy the restricted isometry property (RIP) with high probability, where the RIP of the measurement matrix is crucial for a thresholding‐based algorithm to recover a true sparse solution effectively. Taking Gaussian measurement matrices as an illustrative example, we quantitatively analyze how the preconditioner affects the RIP of the measurement submatrix chosen uniformly at random. The linear convergence of the proposed method is also established under some assumptions. Finally, numerical examples based on synthetic and real‐world data demonstrate the efficiency of the proposed method.
- 19 June 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (3)
Randomized Preconditioned Hard Thresholding Pursuit for Sparse Approximation
Sparsity models with ‐norm constraint are widely used in image processing, statistical regression, wireless communications, and other fields, where numerous thresholding‐based methods are employed. However, when the acquisition of linear measurement is time‐consuming or the measurement matrix is too large to store in memory, many thresholding‐based methods that require the whole measurement matrix become impractical. To address this issue, we propose a randomized preconditioned hard thresholding pursuit algorithm for finding a sparse solution to a linear system of equations with ‐norm constraint. The proposed method is also applicable to general settings. It is well‐known that Gaussian random matrices satisfy the restricted isometry property (RIP) with high probability, where the RIP of the measurement matrix is crucial for a thresholding‐based algorithm to recover a true sparse solution effectively. Taking Gaussian measurement matrices as an illustrative example, we quantitatively analyze how the preconditioner affects the RIP of the measurement submatrix chosen uniformly at random. The linear convergence of the proposed method is also established under some assumptions. Finally, numerical examples based on synthetic and real‐world data demonstrate the efficiency of the proposed method.
- 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
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.
- 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.
- 22 November 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 98 (1) , 1-28
Scaled Proximal Gradient Methods for Sparse Optimization Problems
- 22 November 2023
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 98 (1) , 1-28
Scaled Proximal Gradient Methods for Sparse Optimization Problems
- 23 November 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 43 (4) , 1712-1735
A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
Nonnegative matrix factorization arises widely in machine learning and data analysis. In this paper, for a given factorization of rank \(r\) , we consider the sparse stochastic matrix fac...- 23 November 2022
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 43 (4) , 1712-1735
A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization
Nonnegative matrix factorization arises widely in machine learning and data analysis. In this paper, for a given factorization of rank \(r\) , we consider the sparse stochastic matrix fac...- 16 November 2022
- Published by Springer Nature in Calcolo
- Vol. 59 (4) , 1-28
Single-pass randomized QLP decomposition for low-rank approximation
- 16 November 2022
- Published by Springer Nature in Calcolo
- Vol. 59 (4) , 1-28
Single-pass randomized QLP decomposition for low-rank approximation
- Open Access
A mixed precision Jacobi method for the symmetric eigenvalue problem
The eigenvalue problem is a fundamental problem in scientific computing. In this paper, we propose a mixed precision Jacobi method for the symmetric eigenvalue problem. We first compute the eigenvalue decomposition of a real symmetric matrix by an eigensolver at low precision and we obtain a low-precision matrix of eigenvectors. Then by using the modified Gram-Schmidt orthogonalization process to the low-precision eigenvector matrix in high precision, a high-precision orthogonal matrix is obtained, which is used as an initial guess for the Jacobi method. We give the rounding error analysis for the proposed method and the quadratic convergence of the proposed method is established under some sufficient conditions. We also present a mixed precision one-side Jacobi method for the singular value problem and the corresponding rounding error analysis and quadratic convergence are discussed. Numerical experiments on CPUs and GPUs are conducted to illustrate the efficiency of the proposed mixed precision Jacobi method over the original Jacobi method.
Open AccessA mixed precision Jacobi method for the symmetric eigenvalue problem
The eigenvalue problem is a fundamental problem in scientific computing. In this paper, we propose a mixed precision Jacobi method for the symmetric eigenvalue problem. We first compute the eigenvalue decomposition of a real symmetric matrix by an eigensolver at low precision and we obtain a low-precision matrix of eigenvectors. Then by using the modified Gram-Schmidt orthogonalization process to the low-precision eigenvector matrix in high precision, a high-precision orthogonal matrix is obtained, which is used as an initial guess for the Jacobi method. We give the rounding error analysis for the proposed method and the quadratic convergence of the proposed method is established under some sufficient conditions. We also present a mixed precision one-side Jacobi method for the singular value problem and the corresponding rounding error analysis and quadratic convergence are discussed. Numerical experiments on CPUs and GPUs are conducted to illustrate the efficiency of the proposed mixed precision Jacobi method over the original Jacobi method.
- 4 August 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (3) , 1951-1981
A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum
- 4 August 2022
- Published by Springer Nature in Numerical Algorithms
- Vol. 92 (3) , 1951-1981
A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum