A Simple Algorithm for Constructing all Real Hessenberg Unitary Matrices

preprint2011arXivOpen access

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×nn\times n unitary matrices given by the algorithm have n−1n-1 variables which can be chosen to give additional properties needed for a particular application.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.