相关论文: Real Schur norms and Hadamard matrices

In this paper we develop algorithms for approximating matrix multiplication with respect to the spectral norm. Let A\in{\RR^{n\times m}} and B\in\RR^{n \times p} be two matrices and \eps>0. We approximate the product A^\top B using two…

In a recent article, Ch\'avez, Garcia and Hurley introduced a new family of norms $\|\cdot\|_{\mathbf{X},d}$ on the space of $n \times n$ complex matrices which are induced by random vectors $\mathbf{X}$ having finite $d$-moments. Therein,…

Matrices with displacement structure such as Pick, Vandermonde, and Hankel matrices appear in a diverse range of applications. In this paper, we use an extremal problem involving rational functions to derive explicit bounds on the singular…

For a matrix $T \in M_m(\mathbb{C})$, let $|T| : = \sqrt{T^*T}$. For $A \in M_m(\mathbb{C})$, we show that the matrix sequence $\big\{ |A^n|^{\frac{1}{n}} \big\}_{n \in \mathbb{N}}$ converges in norm to a positive-semidefinite matrix $H$…

The permanent-on-top conjecture states that the largest eigenvalue of the Schur power matrix of a positive semi-definite Hermitian matrix H is per(H). A counterexample has been found with the help of computers, but here, I present another…

We introduce Hadamard matrices whose entries are quaternionic. We then go on to provide classification of quaternionic Hadamard matrices of circulant core of orders 2 through 5. We also introduce quaternionic Hadamard matrices of Butson…

A Butson-Hadamard matrix H is a square matrix of dimension n whose entries are complex roots of unity such that HH*= nI. In the first part of this work, some new results on generalized Gray map are studied. In the second part, codes…

Given an appropriate class of structured matrices S; we characterize matrices X and B for which there exists a matrix A \in S such that AX = B and determine all matrices in S mapping X to B. We also determine all matrices in S mapping X to…

We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.

In this paper we consider symmetric, positive semidefinite (SPSD) matrix $A$ and present two algorithms for computing the $p$-Schatten norm $\|A\|_p$. The first algorithm works for any SPSD matrix $A$. The second algorithm works for…

Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. Based on the theory of operator spaces and completely bounded mappings we present norm optimal versions of these…

Characterizing the $6\times 6$ complex Hadamard matrices (CHMs) is an open problem in linear algebra and quantum information. In this paper, we investigate the eigenvalues and eigenvectors of CHMs. We show that any $n\times n$ CHM with…

Let $M_n$ be a random matrix of size $n\times n$ and let $\lambda_1,...,\lambda_n$ be the eigenvalues of $M_n$. The empirical spectral distribution $\mu_{M_n}$ of $M_n$ is defined as $$\mu_{M_n}(s,t)=\frac{1}{n}# \{k\le n, \Re(\lambda_k)\le…

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…

In this work we study a version of the general question of how well a Haar distributed orthogonal matrix can be approximated by a random gaussian matrix. Here, we consider a gaussian random matrix $Y_n$ of order $n$ and apply to it the…

A matrix algorithm is said to be superfast (that is, runs at sublinear cost) if it involves much fewer scalars and flops than the input matrix has entries. Such algorithms have been extensively studied and widely applied in modern…

In this study, the problem of robust Schur stability of $n\times n$ dimensional matrix segments by using the bialternate product of matrices is considered. It is shown that the problem can be reduced to the existence of negative eigenvalues…

In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…

The trace norm of a matrix is the sum of its singular values. This paper presents results on the minimum trace norm $\psi_{n}\left( m\right) $ of $\left( 0,1\right) $-matrices of size $n\times n$ with exactly $m$ ones. It is shown that: (1)…

A $\{1,-1\}$-matrix $H$ of order $m$ is a Hadamard matrix if $HH^T=mI_m$, where $T$ is the transposition operator and $I_m$ the identity matrix of order $m$. J. Hadamard published his paper on Hadamard matrices in 1893. Five years later,…