Zhongxiao Jia

Orcid: 0000-0001-9761-8517

According to our database1, Zhongxiao Jia authored at least 47 papers between 1995 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Augmented Matrix-Based CJ-FEAST SVDsolver for Computing a Partial Singular Value Decomposition with the Singular Values in a Given Interval.
SIAM J. Matrix Anal. Appl., March, 2024

A Skew-Symmetric Lanczos Bidiagonalization Method for Computing Several Extremal Eigenpairs of a Large Skew-Symmetric Matrix.
SIAM J. Matrix Anal. Appl., 2024

Preconditioning correction equations in Jacobi-Davidson type methods for computing partial singular value decompositions of large matrices.
CoRR, 2024

2023
A FEAST SVDsolver Based on Chebyshev-Jackson Series for Computing Partial Singular Triplets of Large Matrices.
J. Sci. Comput., October, 2023

The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision.
SIAM J. Matrix Anal. Appl., March, 2023

A Cross-Product Free Jacobi-Davidson Type Method for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair.
J. Sci. Comput., 2023

A CJ-FEAST GSVDsolver for computing a partial GSVD of a large matrix pair with the generalized singular values in a given interval.
CoRR, 2023

Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair.
CoRR, 2023

2022
Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems.
SIAM J. Matrix Anal. Appl., 2022

Two Harmonic Jacobi-Davidson Methods for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair.
J. Sci. Comput., 2022

A skew-symmetric Lanczos bidiagonalization method for computing several largest eigenpairs of a large skew-symmetric matrix.
CoRR, 2022

An analysis of the Rayleigh-Ritz and refined Rayleigh-Ritz methods for nonlinear eigenvalue problems.
CoRR, 2022

A FEAST SVDsolver for the computation of singular value decompositions of large matrices based on the Chebyshev-Jackson series expansion.
CoRR, 2022

2021
The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem.
SIAM J. Optim., 2021

The joint bidiagonalization process with partial reorthogonalization.
Numer. Algorithms, 2021

On choices of formulations of computing the generalized singular value decomposition of a large matrix pair.
Numer. Algorithms, 2021

A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem.
CoRR, 2021

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

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

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

Optimal Subspace Expansion for Matrix Eigenvalue Problems.
CoRR, 2020

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

2019
On Inner Iterations of Jacobi-Davidson Type Methods for Large SVD Computations.
SIAM J. Sci. Comput., 2019

A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems.
J. Comput. Appl. Math., 2019

On choices of formulations of computing the generalized singular value decomposition of a matrix pair.
CoRR, 2019

2017
A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems.
Numer. Linear Algebra Appl., 2017

On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems.
J. Comput. Appl. Math., 2017

2015
A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\) -matrix.
Numerische Mathematik, 2015

A posteriori error estimates of krylov subspace approximations to matrix functions.
Numer. Algorithms, 2015

Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems.
J. Comput. Appl. Math., 2015

2013
An Approach to Making SPAI and PSAI Preconditioning Effective for Large Irregular Sparse Linear Systems.
SIAM J. Sci. Comput., 2013

On the condition number of the total least squares problem.
Numerische Mathematik, 2013

2012
On convergence of the inexact Rayleigh quotient iteration with MINRES.
J. Comput. Appl. Math., 2012

2011
The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs.
J. Comput. Appl. Math., 2011

2010
A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices.
SIAM J. Sci. Comput., 2010

Some properties of LSQR for large sparse linear least squares problems.
J. Syst. Sci. Complex., 2010

A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems.
J. Comput. Appl. Math., 2010

Applications of the Conjugate Gradient method in optimal surface parameterizations.
Int. J. Comput. Math., 2010

2009
A power sparse approximate inverse preconditioning procedure for large sparse linear systems.
Numer. Linear Algebra Appl., 2009

2006
Using cross-product matrices to compute the SVD.
Numer. Algorithms, 2006

2005
The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors.
Math. Comput., 2005

A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm.
Math. Comput. Model., 2005

2003
An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition.
SIAM J. Matrix Anal. Appl., 2003

2001
An analysis of the Rayleigh-Ritz method for approximating eigenspaces.
Math. Comput., 2001

1998
Generalized block Lanczos methods for large unsymmetric eigenproblems.
Numerische Mathematik, 1998

1996
On IOM(<i>q</i>): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems.
Numer. Linear Algebra Appl., 1996

1995
The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems.
SIAM J. Matrix Anal. Appl., 1995


  Loading...