| Two Harmonic Jacobi–Davidson Methods for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair | 0 | 0.34 | 2022 |
| Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems | 0 | 0.34 | 2022 |
| On Choices Of Formulations Of Computing The Generalized Singular Value Decomposition Of A Large Matrix Pair | 1 | 0.36 | 2021 |
| The Joint Bidiagonalization Process With Partial Reorthogonalization | 1 | 0.36 | 2021 |
| The Convergence Of The Generalized Lanczos Trust-Region Method For The Trust-Region Subproblem | 0 | 0.34 | 2021 |
| On inner iterations of Jacobi-Davidson type methods for large SVD computations | 1 | 0.36 | 2019 |
| A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems. | 0 | 0.34 | 2019 |
| On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems. | 0 | 0.34 | 2017 |
| A posteriori error estimates of krylov subspace approximations to matrix functions | 4 | 0.44 | 2015 |
| A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible M-matrix | 2 | 0.46 | 2015 |
| Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems | 3 | 0.43 | 2015 |
| A Residual Based Sparse Approximate Inverse Preconditioning Procedure for Large Sparse Linear Systems. | 1 | 0.37 | 2015 |
| An Approach to Making SPAI and PSAI Preconditioning Effective for Large Irregular Sparse Linear Systems. | 1 | 0.35 | 2013 |
| On the condition number of the total least squares problem | 5 | 0.51 | 2013 |
| On convergence of the inexact Rayleigh quotient iteration with MINRES | 2 | 0.44 | 2012 |
| The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs | 0 | 0.34 | 2011 |
| A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems | 1 | 0.35 | 2010 |
| Applications of the Conjugate Gradient method in optimal surface parameterizations | 0 | 0.34 | 2010 |
| Some properties of LSQR for large sparse linear least squares problems. | 2 | 0.38 | 2010 |
| Some properties of LSQR for large sparse linear least squares problems. | 2 | 0.38 | 2010 |
| A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices | 10 | 0.67 | 2010 |
| A power sparse approximate inverse preconditioning procedure for large sparse linear systems | 6 | 0.52 | 2009 |
| Using cross-product matrices to compute the SVD | 2 | 0.43 | 2006 |
| The convergence of harmonic Ritz values, harmonic Ritz vectors, and refined harmonic Ritz vectors | 15 | 0.99 | 2005 |
| A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm | 0 | 0.34 | 2005 |
| An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition | 14 | 1.07 | 2003 |
| An analysis of the Rayleigh—Ritz method for approximating eigenspaces | 26 | 3.24 | 2001 |
| Generalized block Lanczos methods for large unsymmetric eigenproblems | 5 | 1.33 | 1998 |
| On Iom(Q): The Incomplete Orthogonalization Method For Large Unsymmetric Linear Systems | 1 | 0.37 | 1996 |
| The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems | 16 | 2.04 | 1995 |
