Results 1 to 10 of about 246 (214)
Linear Preservers of Chain Majorization [PDF]
Journal of Mathematical Extension, 2008 For (n×m matrices) X, Y ∈ Mnm(R)(= Mnm), we say X is chain majorized by Y and write X ≺≺ Y if X = RY where R is a product of finitely many T-transforms. A linear operator T : Mnm → Mnm is said to be a linear preserver of the relation ≺≺ on Mnm if X ≺≺
P. Torabian
doaj +1 more source
On linear preservers of semipositive matrices [PDF]
, 2021 Given proper cones $K_1$ and $K_2$ in $\mathbb{R}^n$ and $\mathbb{R}^m$, respectively, an $m \times n$ matrix $A$ with real entries is said to be semipositive if there exists a $x \in K_1^{\circ}$ such that $Ax \in K_2^{\circ}$, where $K^{\circ}$ denotes
Mer, Vatsalkumar +1 more
core +1 more source
Linear preserver of $n\times 1$ Ferrers vectors [PDF]
, 2023 summary:Let $A=[a_{ij}]_{m\times n}$ be an $m\times n$ matrix of zeros and ones. The matrix $A$ is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero $(1,1)$-entry.
Armandnejad, Ali, Fazlpar, Leila
core +1 more source
SGLT-MAJORIZATION ON Mn,m AND ITS LINEAR PRESERVERS [PDF]
Journal of Mahani Mathematical Research, 2018 A matrix R is said to be g-row substochastic if Re ≤ e. For X, Y ∈ Mn,m, it is said that X is sglt-majorized by Y , X ≺sglt Y , if there exists an n-by-n lower triangular g-row substochastic matrix R such that X = RY .
Asma Ilkhanizadeh Manesh
doaj +1 more source
Row Hadamard majorization on ${\bf M}_{m,n}$ [PDF]
, 2021 summary:An $m \times n$ matrix $R$ with nonnegative entries is called row stochastic if the sum of entries on every row of $R$ is 1. Let ${\bf M}_{m,n}$ be the set of all $m \times n$ real matrices. For $A,B\in \nobreak {\bf M}_{m,n}$, we say that $A$ is
Askarizadeh, Abbas, Armandnejad, Ali
core +1 more source
Strong Stability Preserving Runge–Kutta and Linear Multistep Methods
Bulletin of the Iranian Mathematical Society, 2022 AbstractThis paper reviews strong stability preserving discrete variable methods for differential systems. The strong stability preserving Runge–Kutta methods have been usually investigated in the literature on the subject, using the so-called Shu–Osher representation of these methods, as a convex combination of first-order steps by forward Euler ...
Izzo G., Jackiewicz Z.
openaire +2 more sources
New Extremal Bounds for Reachability and Strong-Connectivity Preservers Under Failures [PDF]
, 2020 In this paper, we consider the question of computing sparse subgraphs for any input directed graph G = (V,E) on n vertices and m edges, that preserves reachability and/or strong connectivity structures.
Choudhary, Keerti, Chakraborty, Diptarka
core +1 more source
Linear Transformations Preserving the Strong $q$-log-convexity of Polynomials
The Electronic Journal of Combinatorics, 2015 In this paper, we give a sufficient condition for the linear transformation preserving the strong $q$-log-convexity. As applications, we get some linear transformations (for instance, Morgan-Voyce transformation, binomial transformation, Narayana transformations of two kinds) preserving the strong $q$-log-convexity.
Bao-Xuan Zhu, Hua Sun
openaire +4 more sources
Linear preservers of row-dense matrices [PDF]
, 2016 summary:Let $\mathbf {M}_{m,n}$ be the set of all $m\times n$ real matrices. A matrix $A\in \mathbf {M}_{m,n}$ is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix.
Hall, Frank J. +2 more
core +1 more source
Strong-stability-preserving additive linear multistep methods
Mathematics of Computation, 2018 The analysis of strong-stability-preserving (SSP) linear multistep methods is extended to semi-discretized problems for which different terms on the right-hand side satisfy different forward Euler (or circle) conditions. Optimal perturbed and additive monotonicity-preserving linear multistep methods are studied in the context of such problems.
Yiannis Hadjimichael, David I. Ketcheson
openaire +4 more sources