Advances in Computational Mathematics

, Volume 24, Issue 1–4, pp 297–309 | Cite as

Generation of finite tight frames by Householder transformations

  • De-Jun FengEmail author
  • Long Wang
  • Yang Wang


Finite tight frames are widely used for many applications. An important problem is to construct finite frames with prescribed norm for each vector in the tight frame. In this paper we provide a fast and simple algorithm for such a purpose. Our algorithm employs the Householder transformations. For a finite tight frame consisting of m vectors in ℝn or ℂn only O(nm) operations are needed. In addition, we also study the following question: Given a set of vectors in ℝn or ℂn, how many additional vectors, possibly with constraints, does one need to add in order to obtain a tight frame?


frames tight frame tight frame matrix Householder matrix condition number 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.J. Benedetto and M. Fickus, Finite normalized tight frames, Adv. Comput. Math. 18 (2003) 357–385. MathSciNetCrossRefGoogle Scholar
  2. [2]
    P.G. Casazza, Modern tools for Weyl–Heisenberg (Gabor) frame theory, Adv. Image Electron Phys. 115 (2000) 1–127. Google Scholar
  3. [3]
    P.G. Casazza and M. Leon, Existence and construction of finite tight frames, Preprint. Google Scholar
  4. [4]
    P.G. Casazza, M. Leon and J.C. Tremain, Custom built tight frames, Preprint. Google Scholar
  5. [5]
    P.G. Casazza and J. Kovačević, Equal-norm tight frames with erasures, Adv. Comput. Math. 18 (2003) 387–430. MathSciNetCrossRefGoogle Scholar
  6. [6]
    R.J. Duffin and A.C. Schaeffer, A class of nonharmonic Fourier series, Trans. Amer. Math. Soc. 72 (1952) 341–366. MathSciNetCrossRefGoogle Scholar
  7. [7]
    Y. Elder and G.D. Forney, Optimal tight frames and quantum measurement, Preprint. Google Scholar
  8. [8]
    V.K. Goyal, J. Kovačević and J.A. Kelner, Quantized frame expansions with erasures, Appl. Comput. Harmon. Anal. 10 (2001) 203–233. MathSciNetCrossRefGoogle Scholar
  9. [9]
    V.K. Goyal, M. Vetterli and N.T. Thao, Quantized overcomplete expansions in ℝN: analysis, synthesis, and algorithms, IEEE Trans. Inform. Theory 44 (1998) 16–31. MathSciNetCrossRefGoogle Scholar
  10. [10]
    K. Gröchenig, Foundation of Time-Frequency Analysis (Birkhäuser, Boston, 2001). Google Scholar
  11. [11]
    A.S. Householder, The Theory of Matrices in Numerical Analysis (Blaisdell Publishing Co. Ginn and Co., New York, 1964). Google Scholar
  12. [12]
    W.V. Parker and J.C. Eaves, Matrices (The Ronald Press Co., New York, 1960). Google Scholar
  13. [13]
    D. Serre, Matrices. Theory and Applications, Translated from the 2001 French original, Grad. Texts in Math., Vol. 216 Springer, (New York, 2002). Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Department of Mathematical SciencesTsinghua UniversityBeijingP.R. China
  2. 2.Mathematics DepartmentSouthern Polytechnic State UniversityMariietaU.S.A.
  3. 3.School of MathematicsGeorgia Institute of TechnologyAtlantaU.S.A.

Personalised recommendations