Block Diagonal Majorization on $C_{0}$

Authors

  • A. Armandnejad
  • F. Passandi
Abstract:

Let $mathbf{c}_0$ be the real vector space of all real sequences which converge to zero. For every $x,yin mathbf{c}_0$, it is said that $y$ is block diagonal majorized by $x$ (written $yprec_b x$) if there exists a block diagonal row stochastic matrix $R$ such that $y=Rx$. In this paper we find the possible structure of linear functions $T:mathbf{c}_0rightarrow mathbf{c}_0$ preserving $prec_b$.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Diagonal Majorization Algorithm: Properties and Efficiency

In this paper, the diagonal majorization algorithm (DMA) has been investigated. The research focuses on the possibilities to increase the efficiency of the algorithm by disclosing its properties. The diagonal majorization algorithm is oriented at the multidimensional data visualization. The experiments have proved that, when visualizing large data set with DMA, it is possible to save the comput...

full text

On diagonal algebraic space-time block codes

Theoretical and practical aspects of diagonal algebraic space-time block codes over n transmit andm receive antennae are examined. These codes are obtained by sending a rotated version of the information symbols over the principal diagonal of the n × n space-time matrix over n transmit antennae and n symbol periods. The output signal-to-noise ratios of two pre-decoding filters and two decoding ...

full text

Block Diagonal Matrices

For simplicity, we adopt the following rules: i, j, m, n, k denote natural numbers, x denotes a set, K denotes a field, a, a1, a2 denote elements of K, D denotes a non empty set, d, d1, d2 denote elements of D, M , M1, M2 denote matrices over D, A, A1, A2, B1, B2 denote matrices over K, and f , g denote finite sequences of elements of N. One can prove the following propositions: (1) Let K be a ...

full text

Block Diagonal Natural Evolution Strategies

The Natural Evolution Strategies (NES) family of search algorithms have been shown to be efficient black-box optimizers, but the most powerful version xNES does not scale to problems with more than a few hundred dimensions. And the scalable variant, SNES, potentially ignores important correlations between parameters. This paper introduces Block Diagonal NES (BD-NES), a variant of NES which uses...

full text

Block-diagonal Hessian-free Optimization

Second-order methods for neural network optimization have several advantages over methods based on first-order gradient descent, including better scaling to large mini-batch sizes and fewer updates needed for convergence. But they are rarely applied to deep learning in practice because of high computational cost and the need for model-dependent algorithmic variations. We introduce a variant of ...

full text

ON THE FUNCTION OF BLOCK ANTI DIAGONAL MATRICES AND ITS APPLICATION

The matrix functions appear in several applications in engineering and sciences. The computation of these functions almost involved complicated theory. Thus, improving the concept theoretically seems unavoidable to obtain some new relations and algorithms for evaluating these functions. The aim of this paper is proposing some new reciprocal for the function of block anti diagonal matrices. More...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 8  issue None

pages  131- 136

publication date 2013-10

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

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023