Threshold circuits for iterated matrix product and powering
Carlo Mereghetti, Beatrice Palano (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Carlo Mereghetti, Beatrice Palano (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Michael Cox, Kevin N. Vander Meulen, Adam Van Tuyl, Joseph Voskamp (2024)
Czechoslovak Mathematical Journal
Similarity:
The Fiedler matrices are a large class of companion matrices that include the well-known Frobenius companion matrix. The Fiedler matrices are part of a larger class of companion matrices that can be characterized by a Hessenberg form. We demonstrate that the Hessenberg form of the Fiedler companion matrices provides a straight-forward way to compare the condition numbers of these matrices. We also show that there are other companion matrices which can provide a much smaller condition...
Mika Mattila, Pentti Haukkanen (2016)
Special Matrices
Similarity:
Let T = {z1, z2, . . . , zn} be a finite multiset of real numbers, where z1 ≤ z2 ≤ · · · ≤ zn. The purpose of this article is to study the different properties of MIN and MAX matrices of the set T with min(zi , zj) and max(zi , zj) as their ij entries, respectively.We are going to do this by interpreting these matrices as so-called meet and join matrices and by applying some known results for meet and join matrices. Once the theorems are found with the aid of advanced methods, we also...
Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu (2001)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
In this paper we introduce a sharpening of the Parikh mapping and investigate its basic properties. The new mapping is based on square matrices of a certain form. The classical Parikh vector appears in such a matrix as the second diagonal. However, the matrix product gives more information about a word than the Parikh vector. We characterize the matrix products and establish also an interesting interconnection between mirror images of words and inverses of matrices.
Takuya Ikuta, Akihiro Munemasa (2015)
Special Matrices
Similarity:
Acomplex Hadamard matrix is a square matrix H with complex entries of absolute value 1 satisfying HH* = nI, where * stands for the Hermitian transpose and I is the identity matrix of order n. In this paper, we first determine the image of a certain rational map from the d-dimensional complex projective space to Cd(d+1)/2. Applying this result with d = 3, we give constructions of complex Hadamard matrices, and more generally, type-II matrices, in the Bose–Mesner algebra of a certain 3-class...
Thomas Ernst (2015)
Special Matrices
Similarity:
In this second article on q-Pascal matrices, we show how the previous factorizations by the summation matrices and the so-called q-unit matrices extend in a natural way to produce q-analogues of Pascal matrices of two variables by Z. Zhang and M. Liu as follows [...] We also find two different matrix products for [...]
Rafael Bru, Ljiljana Cvetković, Vladimir Kostić, Francisco Pedroche (2010)
Open Mathematics
Similarity:
This paper deals with some properties of α1-matrices and α2-matrices which are subclasses of nonsingular H-matrices. In particular, new characterizations of these two subclasses are given, and then used for proving algebraic properties related to subdirect sums and Hadamard products.
Nobuyuki Tamura, Yatsuka Nakamura (2007)
Formalized Mathematics
Similarity:
In this paper the classic theory of matrices of real elements (see e.g. [12], [13]) is developed. We prove selected equations that have been proved previously for matrices of field elements. Similarly, we introduce in this special context the determinant of a matrix, the identity and zero matrices, and the inverse matrix. The new concept discussed in the case of matrices of real numbers is the property of matrices as operators acting on finite sequences of real numbers from both sides....