## References

SHOWING 1-10 OF 25 REFERENCES

### An Algorithm for Calculating the QR and Singular Value Decompositions of Polynomial Matrices

- Computer ScienceIEEE Transactions on Signal Processing
- 2010

This algorithm amounts to transforming a polynomial matrix to upper triangular form by application of a series of paraunitary matrices such as elementary delay and rotation matrices, and can be used to formulate the singular value decomposition (SVD) of a poynomial matrix.

### Quaternion singular value decomposition based on bidiagonalization to a real or complex matrix using quaternion Householder transformations

- MathematicsAppl. Math. Comput.
- 2006

### Unitary Spaces on Clifford Algebras

- Mathematics
- 2007

Abstract.For the complex Clifford algebra (p, q) of dimension n = p + q we define a Hermitian scalar product. This scalar product depends on the signature (p, q) of Clifford algebra. So, we arrive at…

### Universal similarity factorization equalities over real Clifford algebras

- Mathematics
- 1998

A variety of universal similarity factorization equalities over real Clifford algebrasRp,q are established. On the basis of these equalities, real, complex and quaternion matrix representations of…

### An EVD Algorithm for Para-Hermitian Polynomial Matrices

- Computer ScienceIEEE Transactions on Signal Processing
- 2007

An algorithm for computing the eigenvalue decomposition of a para-Hermitian polynomial matrix by means of a paraunitary "similarity" transformation constitutes a generalization of the classical Jacobi algorithm for conventional Hermitian matrix diagonalization.

### Algebras having bases that consist solely of units

- Mathematics
- 2015

Algebras having bases that consist entirely of units (called invertible algebras) are studied. Among other results, it is shown that all finite-dimensional algebras over a field other than the binary…

### Quaternion polynomial matrix diagonalization for the separation of polarized convolutive mixture

- MathematicsSignal Process.
- 2010

### Unitary Error Bases: Constructions, Equivalence, and Applications

- Mathematics, Computer ScienceAAECC
- 2003

This work gives an explicit counterexample in dimension 165 which has been constructed with the help of a computer algebra system and answers the question whether each algebraic construction is equivalent to a combinatorial construction.

### PROPERLY TWISTED GROUPS AND THEIR ALGEBRAS

- Mathematics
- 2011

A proper twist on a group G is a function � : G × G 7→ {−1,1} with the property that, if p,q ∈ G then �(p,q)�(q,q 1) = �(pq,q 1) and �(p 1,p)�(p,q) = �(p 1,pq). The span V of a set of unit vectors B…