default search action
Zhongxiao Jia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Zhongxiao Jia
, Kailiang Zhang:
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. 45(1): 24-58 (2024) - [j35]Jinzhi Huang, Zhongxiao Jia
A Skew-Symmetric Lanczos Bidiagonalization Method for Computing Several Extremal Eigenpairs of a Large Skew-Symmetric Matrix. SIAM J. Matrix Anal. Appl. 45(2): 1114-1147 (2024) - [i15]Jinzhi Huang, Zhongxiao Jia:
Preconditioning correction equations in Jacobi-Davidson type methods for computing partial singular value decompositions of large matrices. CoRR abs/2404.12568 (2024) - 2023
- [j34]Jinzhi Huang, Zhongxiao Jia
A Cross-Product Free Jacobi-Davidson Type Method for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair. J. Sci. Comput. 94(1): 3 (2023) - [j33]Zhongxiao Jia
A FEAST SVDsolver Based on Chebyshev-Jackson Series for Computing Partial Singular Triplets of Large Matrices. J. Sci. Comput. 97(1): 21 (2023) - [j32]Zhongxiao Jia
The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision. SIAM J. Matrix Anal. Appl. 44(1): 382-407 (2023) - [i14]Zhongxiao Jia, Kailiang Zhang:
An augmented matrix-based CJ-FEAST SVDsolver for computing a partial singular value decomposition with the singular values in a given interval. CoRR abs/2301.06280 (2023) - [i13]Jinzhi Huang, Zhongxiao Jia:
Refined and refined harmonic Jacobi-Davidson methods for computing several GSVD components of a large regular matrix pair. CoRR abs/2309.17266 (2023) - [i12]Zhongxiao Jia, Kailiang Zhang:
A CJ-FEAST GSVDsolver for computing a partial GSVD of a large matrix pair with the generalized singular values in a given interval. CoRR abs/2310.10146 (2023) - 2022
- [j31]Jinzhi Huang, Zhongxiao Jia
Two Harmonic Jacobi-Davidson Methods for Computing a Partial Generalized Singular Value Decomposition of a Large Matrix Pair. J. Sci. Comput. 93(2): 41 (2022) - [j30]Zhongxiao Jia:
Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 43(2): 584-604 (2022) - [i11]Zhongxiao Jia, Kailiang Zhang:
A FEAST SVDsolver for the computation of singular value decompositions of large matrices based on the Chebyshev-Jackson series expansion. CoRR abs/2201.02901 (2022) - [i10]Jinzhi Huang, Zhongxiao Jia:
Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair. CoRR abs/2201.02903 (2022) - [i9]Zhongxiao Jia, Qingqing Zheng:
An analysis of the Rayleigh-Ritz and refined Rayleigh-Ritz methods for nonlinear eigenvalue problems. CoRR abs/2212.00302 (2022) - [i8]Jinzhi Huang, Zhongxiao Jia:
A skew-symmetric Lanczos bidiagonalization method for computing several largest eigenpairs of a large skew-symmetric matrix. CoRR abs/2212.07574 (2022) - 2021
- [j29]Jinzhi Huang, Zhongxiao Jia
On choices of formulations of computing the generalized singular value decomposition of a large matrix pair. Numer. Algorithms 87(2): 689-718 (2021) - [j28]Zhongxiao Jia, Haibo Li
The joint bidiagonalization process with partial reorthogonalization. Numer. Algorithms 88(2): 965-992 (2021) - [j27]Zhongxiao Jia, Fa Wang:
The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem. SIAM J. Optim. 31(1): 887-914 (2021) - [i7]Zhongxiao Jia, Fa Wang:
A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem. CoRR abs/2102.09693 (2021) - 2020
- [j26]Zhongxiao Jia:
Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems. J. Comput. Appl. Math. 374: 112786 (2020) - [j25]Zhongxiao Jia:
Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs. Numer. Algorithms 85(4): 1281-1310 (2020) - [i6]Zhongxiao Jia:
The Krylov Subspaces, Low Rank Approximations and Ritz Values of LSQR for Linear Discrete Ill-Posed Problems: the Multiple Singular Value Case. CoRR abs/2003.09259 (2020) - [i5]Zhongxiao Jia:
Optimal Subspace Expansion for Matrix Eigenvalue Problems. CoRR abs/2004.04928 (2020) - [i4]Jinzhi Huang, Zhongxiao Jia:
A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition (GSVD) of a large matrix pair. CoRR abs/2004.13975 (2020)
2010 – 2019
- 2019
- [j24]Zhongxiao Jia, Wenjie Kang:
A transformation approach that makes SPAI, PSAI and RSAI procedures efficient for large double irregular nonsymmetric sparse linear systems. J. Comput. Appl. Math. 348: 200-213 (2019) - [j23]Jinzhi Huang, Zhongxiao Jia:
On Inner Iterations of Jacobi-Davidson Type Methods for Large SVD Computations. SIAM J. Sci. Comput. 41(3): A1574-A1603 (2019) - [i3]Jinzhi Huang, Zhongxiao Jia:
On choices of formulations of computing the generalized singular value decomposition of a matrix pair. CoRR abs/1907.10392 (2019) - [i2]Zhongxiao Jia, Fa Wang:
The convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem. CoRR abs/1908.02094 (2019) - 2017
- [j22]Yi Huang, Zhongxiao Jia:
On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems. J. Comput. Appl. Math. 320: 145-163 (2017) - [j21]Zhongxiao Jia, Wenjie Kang:
A residual based sparse approximate inverse preconditioning procedure for large sparse linear systems. Numer. Linear Algebra Appl. 24(2) (2017) - 2015
- [j20]Zhongxiao Jia, Cen Li:
Harmonic and refined harmonic shift-invert residual Arnoldi and Jacobi-Davidson methods for interior eigenvalue problems. J. Comput. Appl. Math. 282: 83-97 (2015) - [j19]Zhongxiao Jia, Hui Lv:
A posteriori error estimates of krylov subspace approximations to matrix functions. Numer. Algorithms 69(1): 1-28 (2015) - [j18]Zhongxiao Jia, Wen-Wei Lin, Ching-Sung Liu:
A positivity preserving inexact Noda iteration for computing the smallest eigenpair of a large irreducible \(M\) -matrix. Numerische Mathematik 130(4): 645-679 (2015) - [i1]Zhongxiao Jia, Wenjie Kang:
A Residual Based Sparse Approximate Inverse Preconditioning Procedure for Large Sparse Linear Systems. CoRR abs/1503.04500 (2015) - 2013
- [j17]Zhongxiao Jia, Bingyu Li:
On the condition number of the total least squares problem. Numerische Mathematik 125(1): 61-87 (2013) - [j16]Zhongxiao Jia, Qian Zhang:
An Approach to Making SPAI and PSAI Preconditioning Effective for Large Irregular Sparse Linear Systems. SIAM J. Sci. Comput. 35(4) (2013) - 2012
- [j15]Zhongxiao Jia:
On convergence of the inexact Rayleigh quotient iteration with MINRES. J. Comput. Appl. Math. 236(17): 4276-4295 (2012) - 2011
- [j14]Eric King-Wah Chu, Hung-Yuan Fan, Zhongxiao Jia, Tie-xiang Li, Wen-Wei Lin:
The Rayleigh-Ritz method, refinement and Arnoldi process for periodic matrix pairs. J. Comput. Appl. Math. 235(8): 2626-2639 (2011) - 2010
- [j13]Zhongxiao Jia:
Applications of the Conjugate Gradient method in optimal surface parameterizations. Int. J. Comput. Math. 87(5): 1032-1039 (2010) - [j12]Congying Duan, Zhongxiao Jia:
A global harmonic Arnoldi method for large non-Hermitian eigenproblems with an application to multiple eigenvalue problems. J. Comput. Appl. Math. 234(3): 845-860 (2010) - [j11]Zhongxiao Jia:
Some properties of LSQR for large sparse linear least squares problems. J. Syst. Sci. Complex. 23(4): 815-821 (2010) - [j10]Zhongxiao Jia, Datian Niu:
A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices. SIAM J. Sci. Comput. 32(2): 714-744 (2010)
2000 – 2009
- 2009
- [j9]Zhongxiao Jia, Baochen Zhu:
A power sparse approximate inverse preconditioning procedure for large sparse linear systems. Numer. Linear Algebra Appl. 16(4): 259-299 (2009) - 2006
- [j8]Zhongxiao Jia:
Using cross-product matrices to compute the SVD. Numer. Algorithms 42(1): 31-61 (2006) - 2005
- [j7]Guizhi Chen, Zhongxiao Jia:
A refined harmonic Rayleigh-Ritz procedure and an explicitly restarted refined harmonic Arnoldi algorithm. Math. Comput. Model. 41(6-7): 615-627 (2005) - [j6]Zhongxiao Jia:
The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors. Math. Comput. 74(251): 1441-1456 (2005) - 2003
- [j5]Zhongxiao Jia, Datian Niu:
An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition. SIAM J. Matrix Anal. Appl. 25(1): 246-265 (2003) - 2001
- [j4]Zhongxiao Jia, G. W. Stewart:
An analysis of the Rayleigh-Ritz method for approximating eigenspaces. Math. Comput. 70(234): 637-647 (2001)
1990 – 1999
- 1998
- [j3]Zhongxiao Jia:
Generalized block Lanczos methods for large unsymmetric eigenproblems. Numerische Mathematik 80(2): 239-266 (1998) - 1996
- [j2]Zhongxiao Jia:
On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems. Numer. Linear Algebra Appl. 3(6): 491-512 (1996) - 1995
- [j1]Zhongxiao Jia:
The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems. SIAM J. Matrix Anal. Appl. 16(3): 843-862 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: