Displaying 1901 – 1920 of 2599

Showing per page

Row Hadamard majorization on 𝐌 m , n

Abbas Askarizadeh, Ali Armandnejad (2021)

Czechoslovak Mathematical Journal

An m × n matrix R with nonnegative entries is called row stochastic if the sum of entries on every row of R is 1. Let 𝐌 m , n be the set of all m × n real matrices. For A , B 𝐌 m , n , we say that A is row Hadamard majorized by B (denoted by A R H B ) if there exists an m × n row stochastic matrix R such that A = R B , where X Y is the Hadamard product (entrywise product) of matrices X , Y 𝐌 m , n . In this paper, we consider the concept of row Hadamard majorization as a relation on 𝐌 m , n and characterize the structure of all linear operators T : 𝐌 m , n 𝐌 m , n preserving (or...

Schur multiplier characterization of a class of infinite matrices

A. Marcoci, L. Marcoci, L. E. Persson, N. Popa (2010)

Czechoslovak Mathematical Journal

Let B w ( p ) denote the space of infinite matrices A for which A ( x ) p for all x = { x k } k = 1 p with | x k | 0 . We characterize the upper triangular positive matrices from B w ( p ) , 1 < p < , by using a special kind of Schur multipliers and the G. Bennett factorization technique. Also some related results are stated and discussed.

Self-correcting iterative methods for computing 2 -inverses

Stanimirović, Predrag S. (2003)

Archivum Mathematicum

In this paper we construct a few iterative processes for computing { 2 } -inverses of a linear bounded operator. These algorithms are extensions of the corresponding algorithms introduced in [11] and a method from [8]. A few error estimates are derived.

Currently displaying 1901 – 1920 of 2599