Results 31 to 40 of about 562,872 (260)

On some p-almost Hadamard matrices

open access: yesOperators and Matrices, 2019
Let M(n,R) be the space of all real valued n× n matrices and O(n,R) be the orthogonal group. A square matrix Hn ∈ M(n,R) is called “almost Hadamard” if Un := Hn/ √ n is orthogonal, and locally maximizes the 1-norm on O(n,R) . The matrix Hn is “ p -almost
M. T. Mohan
semanticscholar   +1 more source

Symmetric Hadamard Matrices of Orders 268, 412, 436 and 604 [PDF]

open access: yesInformation and Control Systems, 2018
Purpose.To investigate more fully, than what was done in the past, certain families of symmetric Hadamard matrices of small orders by using the so called propus construction.Methods.Orbit method for the search of three cyclic blocks to construct Hadamard
N. A. Balonin, D. ¯Dokovi´c
semanticscholar   +1 more source

On Some Matrix Trace Inequalities

open access: yesJournal of Inequalities and Applications, 2010
We first present an inequality for the Frobenius norm of the Hadamard product of two any square matrices and positive semidefinite matrices. Then, we obtain a trace inequality for products of two positive semidefinite block matrices by using 2×2 ...
Ramazan Türkmen   +1 more
doaj   +2 more sources

Complex Hadamard Matrices contained in a Bose–Mesner algebra

open access: yesSpecial Matrices, 2015
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.
Ikuta Takuya, Munemasa Akihiro
doaj   +1 more source

Generating binary partial Hadamard matrices

open access: yesDiscrete Applied Mathematics, 2019
This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to generate about a half (which is the best asymptotic bound known so far, see de Launey (2000) and de Launey and Gordon (2001)) of a full Hadamard matrix, it ...
V. Álvarez   +6 more
semanticscholar   +1 more source

Applications of Hadamard matrices

open access: yesJournal of Telecommunications and Information Technology, 2003
We present a number of applications of Hadamard matrices to signal processing, optical multiplexing, error correction coding, and design and analysis of statistics.
Haralambos Evangelaras   +2 more
doaj   +1 more source

Green Matrices, Minors and Hadamard Products

open access: yesAxioms, 2023
Green matrices are interpreted as discrete version of Green functions and are used when working with inhomogeneous linear system of differential equations.
Jorge Delgado   +2 more
doaj   +1 more source

Kochen-Specker sets and Hadamard matrices [PDF]

open access: yesTheoretical Computer Science, 2016
We introduce a new class of complex Hadamard matrices which have not been studied previously. We use these matrices to construct a new infinite family of parity proofs of the Kochen-Specker theorem.
P. Lisoněk
semanticscholar   +1 more source

Construction of Sylvester-Hadamard Matrices by Using Binary Code [PDF]

open access: yesمجلة جامعة الانبار للعلوم الصرفة, 2009
A simple method is presented which defines Sylvester-Hadamard matrices in terms of products of binary code. This method is based representation of natural number as binary code which take only two value 0 or 1.
doaj   +1 more source

Amicable hadamard matrices

open access: yesJournal of Combinatorial Theory, Series A, 1971
AbstractIf X is a symmetric Hadamard matrix, Y is a skew-Hadamard matrix, and XYT is symmetric, then X and Y are said to be amicable Hadamard matrices. A construction for amicable Hadamard matrices is given, and then amicable Hadamard matrices are used to generalize a construction for skew-Hadamard matrices.
openaire   +2 more sources

Home - About - Disclaimer - Privacy