AI Chat AI Image Generator AI Video Text to Speech

Density of diagonalizable matrices in sets of structured matrices defined from indefinite scalar products

07/01/2020

∙

by Ralph John de la Cruz, et al.

∙

∙

For an (indefinite) scalar product [x,y]_B = x^HBy for B= ± B^H ∈ Gl_n(ℂ) on ℂ^n ×ℂ^n we show that the set of diagonalizable matrices is dense in the set of all B-selfadjoint, B-skewadjoint, B-unitary and B-normal matrices.

Ralph John de la Cruz
2 publications
Philip Saltenberger
6 publications

page 1

page 2

page 3

page 4

research

∙ 05/19/2021

Pseudo-Hadamard matrices of the first generation and an algorithm for producing them

Hadamard matrices in {0,1} presentation are square m× m matrices whose e...

0 Ruslan Sharipov, et al. ∙

research

∙ 06/27/2020

Generic canonical forms for perplectic and symplectic normal matrices

Let B be some invertible Hermitian or skew-Hermitian matrix. A matrix A ...

0 Ralph John de la Cruz, et al. ∙

research

∙ 10/27/2019

Structure-preserving diagonalization of matrices in indefinite inner product spaces

In this work some results on the structure-preserving diagonalization of...

0 Philip Saltenberger, et al. ∙

research

∙ 06/21/2021

Multiplying Matrices Without Multiplying

Multiplying matrices is among the most fundamental and compute-intensive...

72 Davis Blalock, et al. ∙

research

∙ 05/04/2021

Hadamard matrices in {0,1} presentation and an algorithm for generating them

Hadamard matrices are square n× n matrices whose entries are ones and mi...

0 Ruslan Sharipov, et al. ∙

research

∙ 05/24/2019

New ways to multiply 3 x 3-matrices

It is known since the 1970s that no more than 23 multiplications are req...

0 Marijn J. H. Heule, et al. ∙

research

∙ 04/18/2020

Intersection theorems for (-1,0,1)-vectors

In this paper, we investigate Erdős–Ko–Rado type theorems for families o...

0 Peter Frankl, et al. ∙