‎A matrix LSQR algorithm for solving constrained linear operator equations

author

  • Masoud Hajarian Department of Mathematics Faculty of Mathematical Sciences Shahid Beheshti University, G.C., Evin, Tehran 19839 Iran
Abstract:

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‎.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

‎a matrix lsqr algorithm for solving constrained linear operator equations

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}$‎, ‎$ma...

full text

A Matrix Lsqr Algorithm for Solving Constrained Linear Operator Equations

In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation A(X) = B and the minimum Frobenius norm residual problem ||A(X)−B||F where X ∈ S := {X ∈ Rn×n | X = G(X)}, F is the linear operator from Rn×n onto Rr×s, G is a linear selfconjugate involution operator and B ∈ Rr×s. Numerical examples are given to verify the efficien...

full text

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

full text

a numerical algorithm for solving a class of matrix equations

in this paper, we present a numerical algorithm for solving matrix equations $(a otimes b)x = f$  by extending the well-known gaussian elimination for $ax = b$. the proposed algorithm has a high computational efficiency. two numerical examples are provided to show the effectiveness of the proposed algorithm.

full text

A new approach for solving the first-order linear matrix differential equations

Abstract. The main contribution of the current paper is to propose a new effective numerical method for solving the first-order linear matrix differential equations. Properties of the Legendre basis operational matrix of integration together with a collocation method are applied to reduce the problem to a coupled linear matrix equations. Afterwards, an iterative algorithm is examined for solvin...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 40  issue 1

pages  41- 53

publication date 2014-02-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023