The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems. - Zhongxiao Jia (SIAM J. Matrix Anal. Appl., 1995)

On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems. - Zhongxiao Jia (Numer. Linear Algebra Appl., 1996)

Generalized block Lanczos methods for large unsymmetric eigenproblems. - Zhongxiao Jia (Numerische Mathematik, 1998)

An analysis of the Rayleigh-Ritz method for approximating eigenspaces. - Zhongxiao Jia; G. W. Stewart (Math. Comput., 2001)

An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition. - Zhongxiao Jia; Datian Niu (SIAM J. Matrix Anal. Appl., 2003)

A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm. - Guizhi Chen; Zhongxiao Jia (Math. Comput. Model., 2005)

The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors. - Zhongxiao Jia (Math. Comput., 2005)

Using cross-product matrices to compute the SVD. - Zhongxiao Jia (Numer. Algorithms, 2006)

A power sparse approximate inverse preconditioning procedure for large sparse linear systems. - Zhongxiao Jia; Baochen Zhu (Numer. Linear Algebra Appl., 2009)

Applications of the Conjugate Gradient method in optimal surface parameterizations. - Zhongxiao Jia (Int. J. Comput. Math., 2010)

A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems. - Congying Duan; Zhongxiao Jia (J. Comput. Appl. Math., 2010)

Some properties of LSQR for large sparse linear least squares problems. - Zhongxiao Jia (J. Syst. Sci. Complex., 2010)

A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices. - Zhongxiao Jia; Datian Niu (SIAM J. Sci. Comput., 2010)

The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs. - Eric King-Wah Chu; Hung-Yuan Fan; Zhongxiao Jia; Tie-xiang Li; Wen-Wei Lin (J. Comput. Appl. Math., 2011)

On convergence of the inexact Rayleigh quotient iteration with MINRES. - Zhongxiao Jia (J. Comput. Appl. Math., 2012)

On the condition number of the total least squares problem. - Zhongxiao Jia; Bingyu Li (Numerische Mathematik, 2013)

An Approach to Making SPAI and PSAI Preconditioning Effective for Large Irregular Sparse Linear Systems. - Zhongxiao Jia; Qian Zhang 059 (SIAM J. Sci. Comput., 2013)

Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems. - Zhongxiao Jia; Cen Li (J. Comput. Appl. Math., 2015)

A posteriori error estimates of krylov subspace approximations to matrix functions. - Zhongxiao Jia; Hui Lv (Numer. Algorithms, 2015)

A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible (M ) -matrix. - Zhongxiao Jia; Wen-Wei Lin; Ching-Sung Liu (Numerische Mathematik, 2015)

On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems. - Yi Huang; Zhongxiao Jia (J. Comput. Appl. Math., 2017)

A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems. - Zhongxiao Jia; Wenjie Kang (Numer. Linear Algebra Appl., 2017)

On choices of formulations of computing the generalized singular value decomposition of a matrix pair. - Jinzhi Huang; Zhongxiao Jia (CoRR, 2019)

A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems. - Zhongxiao Jia; Wenjie Kang (J. Comput. Appl. Math., 2019)

On Inner Iterations of Jacobi-Davidson Type Methods for Large SVD Computations. - Jinzhi Huang; Zhongxiao Jia (SIAM J. Sci. Comput., 2019)

The Krylov Subspaces, Low Rank Approximations and Ritz Values of LSQR for Linear Discrete Ill-Posed Problems: the Multiple Singular Value Case. - Zhongxiao Jia (CoRR, 2020)

Optimal Subspace Expansion for Matrix Eigenvalue Problems. - Zhongxiao Jia (CoRR, 2020)

A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition (GSVD) of a large matrix pair. - Jinzhi Huang; Zhongxiao Jia (CoRR, 2020)

Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems. - Zhongxiao Jia (J. Comput. Appl. Math., 2020)

Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs. - Zhongxiao Jia (Numer. Algorithms, 2020)

A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem. - Zhongxiao Jia; Fa Wang (CoRR, 2021)

On choices of formulations of computing the generalized singular value decomposition of a large matrix pair. - Jinzhi Huang; Zhongxiao Jia (Numer. Algorithms, 2021)

The joint bidiagonalization process with partial reorthogonalization. - Zhongxiao Jia; Haibo Li 007 (Numer. Algorithms, 2021)

The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem. - Zhongxiao Jia; Fa Wang (SIAM J. Optim., 2021)

A FEAST SVDsolver for the computation of singular value decompositions of large matrices based on the Chebyshev-Jackson series expansion. - Zhongxiao Jia; Kailiang Zhang (CoRR, 2022)

An analysis of the Rayleigh-Ritz and refined Rayleigh-Ritz methods for nonlinear eigenvalue problems. - Zhongxiao Jia; Qingqing Zheng (CoRR, 2022)

A skew-symmetric Lanczos bidiagonalization method for computing several largest eigenpairs of a large skew-symmetric matrix. - Jinzhi Huang; Zhongxiao Jia (CoRR, 2022)

Two Harmonic Jacobi-Davidson Methods for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair. - Jinzhi Huang; Zhongxiao Jia (J. Sci. Comput., 2022)

Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems. - Zhongxiao Jia (SIAM J. Matrix Anal. Appl., 2022)

A Cross-Product Free Jacobi-Davidson Type Method for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair. - Jinzhi Huang; Zhongxiao Jia (J. Sci. Comput., 2023)

The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision. - Zhongxiao Jia; Haibo Li 007 (SIAM J. Matrix Anal. Appl., 2023)

A FEAST SVDsolver Based on Chebyshev-Jackson Series for Computing Partial Singular Triplets of Large Matrices. - Zhongxiao Jia; Kailiang Zhang (J. Sci. Comput., 2023)

Preconditioning correction equations in Jacobi-Davidson type methods for computing partial singular value decompositions of large matrices. - Jinzhi Huang; Zhongxiao Jia (CoRR, 2024)

A Skew-Symmetric Lanczos Bidiagonalization Method for Computing Several Extremal Eigenpairs of a Large Skew-Symmetric Matrix. - Jinzhi Huang; Zhongxiao Jia (SIAM J. Matrix Anal. Appl., 2024)

An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval. - Zhongxiao Jia; Kailiang Zhang (SIAM J. Matrix Anal. Appl., 2024)

An Analysis of the Rayleigh-Ritz and Refined Rayleigh-Ritz Methods for Regular Nonlinear Eigenvalue Problems. - Zhongxiao Jia; Qingqing Zheng (SIAM J. Matrix Anal. Appl., 2025)

An Implicitly Restarted Joint Bidiagonalization Algorithm for Large GSVD Computations. - Kaixiao Fang; Zhongxiao Jia (CoRR, 2025)

Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair. - Jinzhi Huang; Zhongxiao Jia (Numer. Algorithms, 2025)

A CJ-FEAST GSVDsolver for computing a partial GSVD of a large matrix pair with the generalized singular values in a given interval. - Zhongxiao Jia; Kailiang Zhang (Numerische Mathematik, 2025)