activity
20092026
most citedOn the Condition Number of the Total Least Squares Problem

28 citations · 222 across the 42 of their papers we have counts for

collaborators
Showing 2015 · math.NAShow all

5 papers · 2 filters

math.NA2015★ 1 cited

A Transformation Approach that Makes SPAI, PSAI and RSAI Procedures Efficient for Large Double Irregular Nonsymmetric Sparse Linear Systems

Zhongxiao Jia, Wenjie Kang

A sparse matrix is called double irregular sparse if it has at least one relatively dense column and row, and it is double regular sparse if all the columns and rows of it are spar…

math.NA2015★ 1 cited

A Residual Based Sparse Approximate Inverse Preconditioning Procedure for Large Sparse Linear Systems

Zhongxiao Jia, Wenjie Kang

The SPAI algorithm, a sparse approximate inverse preconditioning technique for large sparse linear systems, proposed by Grote and Huckle [SIAM J. Sci. Comput., 18 (1997), pp.~838--…

math.NA2015

On Regularizing Effects of MINRES and MR-II for Large-Scale Symmetric Discrete Ill-Posed Problems

Yi Huang, Zhongxiao Jia

For large scale symmetric discrete ill-posed problems, MINRES and MR-II are often used iterative regularization solvers. We call a regularized solution best possible if it is at le…

math.NA2015★ 3 cited

Some Results on the Regularization of LSQR for Large-Scale Discrete Ill-Posed Problems

Yi Huang, Zhongxiao Jia

LSQR, a Lanczos bidiagonalization based Krylov subspace iterative method, and its mathematically equivalent CGLS applied to normal equations system, are commonly used for large-sca…

math.NA2015★ 2 cited

Some Results on Regularization of LSQR and CGLS for Large-Scale Discrete Ill-Posed Problems

Yi Huang, Zhongxiao Jia

For large-scale discrete ill-posed problems, LSQR, a Lanczos bidiagonalization process based Krylov method, is most often used. It is well known that LSQR has natural regularizing…