@article{oai:ipsj.ixsq.nii.ac.jp:00059699,
 author = {ZhangShaoLiang and Yoshio, Oyanagi and Zhang, ShaoLiang and Yoshio, Oyanagi},
 issue = {2},
 journal = {Journal of Information Processing},
 month = {Jul},
 note = {A class of iterative algorithms for solving large-scale linear least squares problems is proposed. The algorithms are based on the conjugate residual direction  and are well suited to linear least squares problems where the coefficient matrix is large and sparse. The linear convergence and the error bounds of the process are proved  and the convergence condition is analyzed., A class of iterative algorithms for solving large-scale linear least squares problems is proposed. The algorithms are based on the conjugate residual direction, and are well suited to linear least squares problems where the coefficient matrix is large and sparse. The linear convergence and the error bounds of the process are proved, and the convergence condition is analyzed.},
 pages = {121--125},
 title = {Orthomin(k) Method for Linear Least Squares Problem},
 volume = {14},
 year = {1991}
}