On Difference Matrices, Resolvable Transversal Designs and Generalized Hadamard Matrices.
Dieter Jungnickel (1979)
Mathematische Zeitschrift
Similarity:
Displaying similar documents to “Two-level Cretan matrices constructed using SBIBD”
On Difference Matrices, Resolvable Transversal Designs and Generalized Hadamard Matrices.
Certain new M-matrices and their properties with applications
Ratnakaram N. Mohan, Sanpei Kageyama, Moon H. Lee, G. Yang (2008)
Discussiones Mathematicae Probability and Statistics
Similarity:
The Mₙ-matrix was defined by Mohan [21] who has shown a method of constructing (1,-1)-matrices and studied some of their properties. The (1,-1)-matrices were constructed and studied by Cohn [6], Ehrlich [9], Ehrlich and Zeller [10], and Wang [34]. But in this paper, while giving some resemblances of this matrix with a Hadamard matrix, and by naming it as an M-matrix, we show how to construct partially balanced incomplete block designs and some regular graphs by it. Two types of these...
Analysis of PBIB Designs Using Association Matrices.
S. Gupta, M. Singh (1989)
Metrika
Similarity:
First and Second Order Rotatability of Experimental Designs, Moment Matrices, and Information Surfaces.
F. Pukelsheim, N.R. Draper, N. Gaffke (1991)
Metrika
Similarity:
On the basic contrasts in PBIB designs
H. Brzeskwiniewicz (1991)
Applicationes Mathematicae
Similarity:
Explicit forms of block matrices in unbalanced cross classification
H. Mikos (1979)
Applicationes Mathematicae
Similarity:
Elementary triangular matrices and inverses of k-Hessenberg and triangular matrices
Luis Verde-Star (2015)
Special Matrices
Similarity:
We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict k-Hessenberg matrices and banded matrices. Our results can be extended to the cases of block triangular and block Hessenberg matrices. An n × n lower triangular matrix is called elementary if it is of the form I + C, where I is the identity matrix and C is lower triangular and has all of its...
From Liki-designs to Cycle Matrices: The Discovery of Attractive New Symmetries
Paulus Gerdes (2002)
Visual Mathematics
Similarity:
From Liki-designs to Cycle Matrices: The Discovery of Attractive New Symmetries
Paulus Gerdes (2002)
Visual Mathematics
Similarity:
A Note on Chessboard Matrices
Paulus Gerdes (2002)
Visual Mathematics
Similarity:
On a definition and notation of matrices. On a kind of switch matrices
Đ. Kurepa (1952)
Matematički Vesnik
Similarity:
Helix matrices
Paulus Gerdes (2002)
Visual Mathematics
Similarity:
Pentadiagonal Companion Matrices
Brydon Eastman, Kevin N. Vander Meulen (2016)
Special Matrices
Similarity:
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...