TY - JOUR ID - 482 TI - ‎A matrix LSQR algorithm for solving constrained linear operator equations JO - Bulletin of the Iranian Mathematical Society JA - BIMS LA - en SN - 1017-060X AU - Hajarian, Masoud AD - Department of Mathematics Faculty of Mathematical Sciences Shahid Beheshti University, G.C., Evin, Tehran 19839 Iran Y1 - 2014 PY - 2014 VL - 40 IS - 1 SP - 41 EP - 53 KW - Iterative method KW - Bidiagonalization procedure KW - Linear operator equation DO - N2 - In this work‎, ‎an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$‎ ‎and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$‎ ‎where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$‎, ‎$mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$‎, ‎$mathcal{G}$ is a linear self-conjugate involution operator and‎ ‎$Bin textsf{R}^{rtimes s}$‎. ‎Numerical examples are given to verify the efficiency of the constructed method‎. UR - http://bims.iranjournals.ir/article_482.html L1 - http://bims.iranjournals.ir/article_482_84ccde0152b76da6ba408ddf2be03cef.pdf ER -