pith. sign in

arxiv: 1111.2435 · v1 · pith:C5H5VKLRnew · submitted 2011-11-10 · 🧮 math.FA

A Simple Algorithm for Constructing all Real Hessenberg Unitary Matrices

classification 🧮 math.FA
keywords unitarymatricesalgorithmgivehessenbergconstructinggivenmatrix
0
0 comments X
read the original abstract

Unitary matrices which are zero below the secondary diagonal (Hessenberg unitary matrices) have many uses in analysis. Given a set of needed conditions on a unitary matrix, this algorithm will give the sparsest unitary matrix. We give an algorithm for constructing all real Hessenberg unitary matrices. The $n\times n$ unitary matrices given by the algorithm have $n-1$ variables which can be chosen to give additional properties needed for a particular application.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.