Displaying 81 – 100 of 129

Showing per page

On upper triangular nonnegative matrices

Yizhi Chen, Xian Zhong Zhao, Zhongzhu Liu (2015)

Czechoslovak Mathematical Journal

We first investigate factorizations of elements of the semigroup S of upper triangular matrices with nonnegative entries and nonzero determinant, provide a formula for ρ ( S ) , and, given A S , also provide formulas for l ( A ) , L ( A ) and ρ ( A ) . As a consequence, open problem 2 and problem 4 presented in N. Baeth et al. (2011), are partly answered. Secondly, we study the semigroup of upper triangular matrices with only positive integral entries, compute some invariants of such semigroup, and also partly answer open Problem...

Optimal design in small amplitude homogenization

Grégoire Allaire, Sergio Gutiérrez (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

This paper is concerned with optimal design problems with a special assumption on the coefficients of the state equation. Namely we assume that the variations of these coefficients have a small amplitude. Then, making an asymptotic expansion up to second order with respect to the aspect ratio of the coefficients allows us to greatly simplify the optimal design problem. By using the notion of H-measures we are able to prove general existence theorems for small amplitude optimal design and to provide...

Pentadiagonal Companion Matrices

Brydon Eastman, Kevin N. Vander Meulen (2016)

Special Matrices

The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find a Fiedler...

Perimeter preserver of matrices over semifields

Seok-Zun Song, Kyung-Tae Kang, Young Bae Jun (2006)

Czechoslovak Mathematical Journal

For a rank- 1 matrix A = 𝐚 𝐛 t , we define the perimeter of A as the number of nonzero entries in both 𝐚 and 𝐛 . We characterize the linear operators which preserve the rank and perimeter of rank- 1 matrices over semifields. That is, a linear operator T preserves the rank and perimeter of rank- 1 matrices over semifields if and only if it has the form T ( A ) = U A V , or T ( A ) = U A t V with some invertible matrices U and V.

Possible isolation number of a matrix over nonnegative integers

LeRoy B. Beasley, Young Bae Jun, Seok-Zun Song (2018)

Czechoslovak Mathematical Journal

Let + be the semiring of all nonnegative integers and A an m × n matrix over + . The rank of A is the smallest k such that A can be factored as an m × k matrix times a k × n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A . For A with isolation number k , we investigate the possible values of the rank of A ...

Rational realization of the minimum ranks of nonnegative sign pattern matrices

Wei Fang, Wei Gao, Yubin Gao, Fei Gong, Guangming Jing, Zhongshan Li, Yan Ling Shao, Lihua Zhang (2016)

Czechoslovak Mathematical Journal

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set { + , - , 0 } ( { + , 0 } , respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix 𝒜 is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of 𝒜 . Using a correspondence between sign patterns with minimum rank r 2 and point-hyperplane configurations in r - 1 and Steinitz’s theorem on the rational realizability of...

Currently displaying 81 – 100 of 129