A generalization of Gram-Schmidt orthogonalization generating all Parseval frames

Given an arbitrary finite sequence of vectors in a finite–dimensional Hilbert space, we describe an algorithm, which computes a Parseval frame for the subspace generated by the input vectors while preserving redundancy exactly. We further investigate several of its properties. Finally, we apply the algorithm to several numerical examples.

• Type: Journal
• Year: 2007
• Where: ADCM
• Authors: Peter G. Casazza, Gitta Kutyniok
• Keywords: ADCM 2007, Arbitrary finite Sequence, Input Vectors, finite–dimensional Hilbert Space