The first infinite families of symmetric designswere obtained fromfinite projective geometries, Hadamardmatrices, and difference sets. In this paper we describe two general methods of constructing symmetric designs that give rise to the parameters of all other known infinite families of symmetric designs. The method of global decomposition produces an incidence matrix of a symmetric design as a...

We consider the inversion of block tridiagonal, block Toeplitz matrices and comment on the behaviour of these inverses as one moves away from the diagonal. Using matrix Möbius transformations, we first present an O(1) representation (with respect to the number of block rows and block columns) for the inverse matrix and subsequently use this representation to characterize the inverse matrix. The...

The inversion problem for square matrices having the structure of a block Hankel-like matrix is studied. Examples of such matrices in&de Hankel striped, Hankel layered, and vector Hankel matrices. It is shown that the components that both determine nonsingularity and construct the inverse of such matrices are closely related to certain matrix polynomials. These matrix polynomials are multidimen...

Recently, several experimental studies have been conducted on block data layout in conjunction with tiling as a data transformation technique to improve cache performance. In this paper, we analyze cache and TLB performance of such alternate layouts (including block data layout and Morton layout) when used in conjunction with tiling. We derive a tight lower bound on TLB performance for standard...

We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...