11 citations · 22 across the 7 of their papers we have counts for
5 papers · 1 filter
On the Polyak momentum variants of the greedy deterministic single and multiple row-action methods
Nian-Ci Wu, Qian Zuo, Yatian Wang
For solving a consistent system of linear equations, the classical row-action (also known as Kaczmarz) method is a simple while really effective iteration solver. Based on the gree…
On the extended randomized multiple row method for solving linear least-squares problems
Nian-Ci Wu, Chengzhi Liu, Yatian Wang +1
The randomized row method is a popular representative of the iterative algorithm because of its efficiency in solving the overdetermined and consistent systems of linear equations.…
Quantum-inspired algorithm for truncated total least squares solution
Qian Zuo, Yimin Wei, Hua Xiang
Total least squares (TLS) methods have been widely used in data fitting. Compared with the least squares method, for TLS problem we takes into account not only the observation erro…
On the relaxed greedy deterministic row and column iterative methods
Nian-Ci Wu, Ling-Xia Cui, Qian Zuo
For solving the large-scale linear system by iteration methods, we utilize the Petrov-Galerkin conditions and relaxed greedy index selection technique and provide two relaxed greed…
A quantum-inspired algorithm for approximating statistical leverage scores
Qian Zuo, Hua Xiang
Suppose a matrix of rank with singular value decomposition , where , $V_{A} \in \ma…