Abstract
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.
Similar content being viewed by others
References
J.J. Benedetto and M. Fickus, Finite normalized tight frames, Adv. Comput. Math. 18 (2003) 357–385.
P.G. Casazza, The art of frame theory, Taiwanese J. Math. 4 (2000) 129–201.
P.G. Casazza, Custom building finite frames, in: Wavelets, Frames and Operator Theory, Contemporary Mathematics, Vol. 345 (Amer. Math. Soc., Providence, RI, 2004) pp. 61–86.
P.G. Casazza and J. Kovaĉević, Equal-norm tight frames with erasures, Adv. Comput. Math. 18 (2003) 387–430.
O. Christensen, An Introduction to Frames and Riesz Bases (Birkhäuser, Boston, 2003).
V.K. Goyal, J. Kovačević and J.A. Kelner, Quantized frame expansions with erasures, Appl. Comput. Harmon. Anal. 10 (2001) 203–233.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J.J. Benedetto
Rights and permissions
About this article
Cite this article
Casazza, P.G., Kutyniok, G. A generalization of Gram–Schmidt orthogonalization generating all Parseval frames. Adv Comput Math 27, 65–78 (2007). https://doi.org/10.1007/s10444-005-7478-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10444-005-7478-1
Keywords
- finite-dimensional Hilbert space
- Gram–Schmidt orthogonalization
- linear dependence
- Parseval frame
- redundancy