Skip to main content
Log in

Generation of finite tight frames by Householder transformations

  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

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?

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. J.J. Benedetto and M. Fickus, Finite normalized tight frames, Adv. Comput. Math. 18 (2003) 357–385.

    Article  MathSciNet  Google Scholar 

  2. P.G. Casazza, Modern tools for Weyl–Heisenberg (Gabor) frame theory, Adv. Image Electron Phys. 115 (2000) 1–127.

    Google Scholar 

  3. P.G. Casazza and M. Leon, Existence and construction of finite tight frames, Preprint.

  4. P.G. Casazza, M. Leon and J.C. Tremain, Custom built tight frames, Preprint.

  5. P.G. Casazza and J. Kovačević, Equal-norm tight frames with erasures, Adv. Comput. Math. 18 (2003) 387–430.

    Article  MathSciNet  Google Scholar 

  6. R.J. Duffin and A.C. Schaeffer, A class of nonharmonic Fourier series, Trans. Amer. Math. Soc. 72 (1952) 341–366.

    Article  MathSciNet  Google Scholar 

  7. Y. Elder and G.D. Forney, Optimal tight frames and quantum measurement, Preprint.

  8. V.K. Goyal, J. Kovačević and J.A. Kelner, Quantized frame expansions with erasures, Appl. Comput. Harmon. Anal. 10 (2001) 203–233.

    Article  MathSciNet  Google Scholar 

  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.

    Article  MathSciNet  Google Scholar 

  10. K. Gröchenig, Foundation of Time-Frequency Analysis (Birkhäuser, Boston, 2001).

    Google Scholar 

  11. A.S. Householder, The Theory of Matrices in Numerical Analysis (Blaisdell Publishing Co. Ginn and Co., New York, 1964).

    Google Scholar 

  12. W.V. Parker and J.C. Eaves, Matrices (The Ronald Press Co., New York, 1960).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to De-Jun Feng.

Additional information

Communicated by J. Benedetto

Dedicated to Dr. Micchelli for his 60th birthday

Mathematics subject classification (2000)

Primary 42C15.

De-Jun Feng: Supported in part by the Special Funds for Major State Basic Research Projects in China.

Yang Wang: Supported in part by the National Science Foundation, grants DMS-0070586 and DMS-0139261.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feng, DJ., Wang, L. & Wang, Y. Generation of finite tight frames by Householder transformations. Adv Comput Math 24, 297–309 (2006). https://doi.org/10.1007/s10444-004-7637-9

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10444-004-7637-9

Keywords

Navigation