Skip to main content

Greedy-Type Bases

  • Chapter
  • First Online:
  • 4208 Accesses

Part of the book series: Graduate Texts in Mathematics ((GTM,volume 233 ))

Abstract

Suppose that X is a Banach space and that \(\mathcal{B} = (e_{n})_{n=1}^{\infty }\) is a basis of X. An m-term approximation with respect to \(\mathcal{B}\) is a map T m : X → X such that for each x ∈ X, T m (x) is a linear combination of at most m elements of \(\mathcal{B}\). An approximation algorithm is a sequence (T m ) m = 1 of such maps.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   89.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. F. Albiac, J.L. Ansorena, Characterization of 1-quasi-greedy bases. J. Approx. Theory 201, 7–12 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. F. Albiac, J.L. Ansorena, S.J. Dilworth, D. Kutzarowa, Existence and uniqueness of greedy bases in Banach spaces. J. Approx. Theory (2016), doi:10.1016/j.jat.2016.06.005 (to appear in press).

    Google Scholar 

  3. F. Albiac, J.L. Ansorena, G. Garrigós, E. Hernández, M. Raja, Conditionality constants of quasi-greedy bases in superreflexive Banach spaces. Stud. Math. 227 (2), 133–140 (2015)

    Article  MATH  Google Scholar 

  4. S.J. Dilworth, D. Mitra, A conditional quasi-greedy basis of l 1. Stud. Math. 144 (1), 95–100 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. S.J. Dilworth, N.J. Kalton, D. Kutzarova, On the existence of almost greedy bases in Banach spaces. Stud. Math. 159 (1), 67–101 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. S.J. Dilworth, N.J. Kalton, D. Kutzarova, V.N. Temlyakov, The thresholding greedy algorithm, greedy bases, and duality. Constr. Approx. 19 (4), 575–597 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. S.J. Dilworth, M. Hoffmann, D.N. Kutzarova, Non-equivalent greedy and almost greedy bases in l p . J. Funct. Spaces Appl. 4 (1), 25–42 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. S.J. Dilworth, M. Soto-Bajo, V.N. Temlyakov, Quasi-greedy bases and Lebesgue-type inequalities. Stud. Math. 211 (1), 41–69 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  9. I.S. Èdel’šteĭn, P. Wojtaszczyk, On projections and unconditional bases in direct sums of Banach spaces. Stud. Math. 56 (3), 263–276 (1976)

    MathSciNet  MATH  Google Scholar 

  10. G. Garrigós, P. Wojtaszczyk, Conditional quasi-greedy bases in Hilbert and Banach spaces. Indiana Univ. Math. J. 63 (4), 1017–1036 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. G. Garrigós, E. Hernández, T. Oikhberg, Lebesgue-type inequalities for quasi-greedy bases. Constr. Approx. 38 (3), 447–470 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. S. Gogyan, An example of an almost greedy basis in L 1(0 1). Proc. Am. Math. Soc. 138 (4), 1425–1432 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. M.I. Kadets, A. Pełczyński, Bases, lacunary sequences and complemented subspaces in the spaces L p . Stud. Math. 21, 161–176 (1961/1962)

    Google Scholar 

  14. S.V. Konyagin, V.N. Temlyakov, A remark on greedy approximation in Banach spaces. East J. Approx. 5 (3), 365–379 (1999)

    MathSciNet  MATH  Google Scholar 

  15. S.V. Konyagin, V.N. Temlyakov, Convergence of greedy approximation. I. General systems. Stud. Math. 159 (1), 143–160 (2003)

    MathSciNet  MATH  Google Scholar 

  16. K. Smela, Subsequences of the Haar basis consisting of full levels in H p for 0 < p < . Proc. Am. Math. Soc. 135 (6), 1709–1716 (2007) (electronic)

    Google Scholar 

  17. V.N. Temlyakov, The best m-term approximation and greedy algorithms. Adv. Comput. Math. 8 (3), 249–265 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. V.N. Temlyakov, Greedy Approximation. Cambridge Monographs on Applied and Computational Mathematics, vol. 20 (Cambridge University Press, Cambridge, 2011)

    Google Scholar 

  19. P. Wojtaszczyk, A Mathematical Introduction to Wavelets. London Mathematical Society Student Texts, vol. 37 (Cambridge University Press, Cambridge, 1997)

    Google Scholar 

  20. P. Wojtaszczyk, Greedy algorithm for general biorthogonal systems. J. Approx. Theory 107 (2), 293–314 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  21. P. Wojtaszczyk, Greedy type bases in Banach spaces, Constructive Theory of Functions (DARBA, Sofia, 2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Albiac, F., Kalton, N.J. (2016). Greedy-Type Bases. In: Topics in Banach Space Theory. Graduate Texts in Mathematics, vol 233 . Springer, Cham. https://doi.org/10.1007/978-3-319-31557-7_10

Download citation

Publish with us

Policies and ethics