Skip to main content

Optimal 1 Rank One Matrix Decomposition

  • Chapter
  • First Online:
Harmonic Analysis and Applications

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 168))

  • 952 Accesses

Abstract

In this paper, we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive semidefinite matrices, we give explicitly these optimal decompositions. These classes include diagonally dominant matrices and certain of their generalizations, 2 × 2, and a class of 3 × 3 matrices.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.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

Institutional subscriptions

References

  1. R. Balan, K.A. Okoudjou, A. Poria, On a Feichtinger problem. Oper. Matrices 12(3), 881–891 (2018)

    Article  MathSciNet  Google Scholar 

  2. G.P. Barker, D.H. Carlson, Cones of diagonally dominant matrices. Pac. J. Math. 57(1), 15–32 (1975)

    Article  MathSciNet  Google Scholar 

  3. F. Clarke, Functional Analysis, Calculus of Variations and Optimal Control. Graduate Texts in Mathematics, vol. 264 (Springer, London, 2013)

    Google Scholar 

  4. J.A. De Loera, X. Goaoc, F. Meunier, N.H. Mustafa, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg. Bull. Am. Math. Soc. 56(3), 415–511 (2019)

    Article  Google Scholar 

  5. N. Dunford, J.T. Schwartz, Linear Operators, Part II (Wiley, New York, 1988)

    MATH  Google Scholar 

  6. H. Feichtinger, P. Jorgensen, D. Larson, G. Ólafsson, Mini-Workshop: Wavelets and Frames, Abstracts from the mini-workshop held 15–21 Feb 2004. Oberwolfach Rep. 1(1), 479–543 (2004)

    Article  MathSciNet  Google Scholar 

  7. C. Heil, D. Larson, Operator theory and modulation spaces. Contemp. Math. 451, 137–150 (2008)

    Article  MathSciNet  Google Scholar 

  8. J. Reay, Generalizations of a theorem of Carathéodory. Mem. Am. Math. Soc. 54 (1965)

    Google Scholar 

  9. B. Simon, Trace Ideals and Their Applications (Cambridge University Press, Cambridge, 1979)

    MATH  Google Scholar 

  10. B. Ycart, Extreme points in convex sets of symmetric matrices. Proc. Am. Math. Soc. 95(4), 607–612 (1985)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

R. Balan was partially supported by the National Science Foundation grant DMS-1816608 and Laboratory for Telecommunication Sciences under grant H9823031D00560049. K. A. Okoudjou was partially supported by the U S Army Research Office grant W911NF1610008, the National Science Foundation grant DMS 1814253, and an MLK visiting professorship.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Radu Balan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Balan, R., Okoudjou, K.A., Rawson, M., Wang, Y., Zhang, R. (2021). Optimal 1 Rank One Matrix Decomposition. In: Rassias, M.T. (eds) Harmonic Analysis and Applications. Springer Optimization and Its Applications, vol 168. Springer, Cham. https://doi.org/10.1007/978-3-030-61887-2_2

Download citation

Publish with us

Policies and ethics