lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...

In a paper [1] the authors ask whether the Frobenius and the H norms are induced. There they claimed that the Frobenius norm is not induced, and consequently conjectured that the H-norm may not be induced. In this note it is shown that the Frobenius norm is induced on particular matrix spaces. It is then shown that the H-norm is in fact induced on a particular matrix-valued L1 space. NOTATION R...

In “Is the Frobenius Matrix Norm Induced?”, the authors ask whether the Frobenius and the norms are induced. There, they claimed that the Frobenius norm is not induced and, consequently, conjectured that the norm may not be induced. In this note, it is shown that the Frobenius norm is induced on particular matrix spaces. It is then shown that the norm is in fact induced on a particular matrix-v...

We deal with two recent conjectures of R.-C. Li [Linear Algebra Appl. 278 (1998) 317– 326], involving unitarily invariant norms and Hadamard products. In the particular case of the Frobenius norm, the first conjecture is known to be true, whereas the second is still an open problem. In fact, in this paper we show that the Frobenius norm is essentially the only invariant norm which may comply wi...

We show that solving the frequency assignment problem is equivalent to solving a minimization problem involving spectral norms of matrices, if the link gain matrix is symmetric. Often the spectral norm is ideal for minimization problems, but not so in this case. We reformulate the minimization using the one-, innnity-and Frobenius norm. This allows us to deal with non symmetric link gain matric...

In this paper‎, ‎we study convergence behavior of the global FOM (Gl-FOM) and global GMRES (Gl-GMRES) methods for solving the matrix equation $AXB=C$ where $A$ and $B$ are symmetric positive definite (SPD)‎. ‎We present some new theoretical results of these methods such as computable exact expressions and upper bounds for the norm of the error and residual‎. ‎In particular‎, ‎the obtained upper...

We show that solving the frequency assignment problem is equivalent to solving a minimization problem involving spectral norms of matrices, if the link gain matrix is symmetric. Often the spectral norm is ideal for minimization problems, but not so in this case. We reformulate the minimization using the one-, innnity-and Frobenius norm. This allows us to deal with non symmetric link gain matric...