Rigidity and Shrinkability of Diagonalizable Matrices
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 21, Issue 6
Abstract
We introduce the seemingly new concept of a rigid matrix based on the comparison of its sparsity to the sparsity of the natural powers of the matrix. Our results could be useful as a usage guide in the scheduling of various iterative algorithms that appear in numerical linear algebra. Especially in Sparse matrix-vector multiplication and they could also be used in matrix norm error analysis.
Authors and Affiliations
Dimitris Karayannakis, Maria-Evgenia Xezonaki
Extensions of Locally Compact Abelian, Torsion-Free Groups by Compact Torsion Abelian Groups
Let X be a compact torsion abelian group. In this paper, we show that an extension of Fp by X splits where Fp is the p-adic number group and p a prime number. Also, we show that an extension of a torsion-free, non-divisi...
Achieving System Reliability with the Fewest Identical Components
enerally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.
Properties of T–Anti-Fuzzy Ideals of a –Near-Ring
In this paper, we define Anti-fuzzy ideal of a -near-ring in and -anti-fuzzy ideal of a -near-ring in . we made an attempt to study the properties of -anti-fuzzy ideal of a -near-ring, union of -anti-fuzzy ideal...
Geodesically Complete Lie Algebroid
In this paper we introduce the notion of geodesically complete Lie algebroid. We give a Riemannian distance on the connected base manifold of a Riemannian Lie algebroid. We also prove that the distance is equivalent to n...
Generation of Checkered Patterns and Their Variations by Making Use of Eulerian Graph Features
A variety of pictures of checkered pattern graphics appear on the Internet. However, rarely seen is how those graphics were produced. This paper shows various checkered patterns and their variations generated automatical...