IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-031-78369-2_9.html
   My bibliography  Save this book chapter

Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices

Author

Listed:
  • Tetiana Parshakova

    (Institute for Computional and Mathematical Engineering)

  • Trevor Hastie

    (Department of Statistics)

  • Eric Darve

    (Mechanical Engineering Department)

  • Stephen Boyd

    (Department of Electrical Engineering)

Abstract

We consider multilevel low rank (MLR) matrices, defined as a row and column permutation of a sum of matrices, each one a block diagonal refinement of the previous one, with all blocks low rank given in factored form. MLR matrices extend low rank matrices but share many of their properties, such as the total storage required and complexity of matrix-vector multiplication. We address three problems that arise in fitting a given matrix by an MLR matrix in the Frobenius norm. The first problem is factor fitting, where we adjust the factors of the MLR matrix. The second is rank allocation, where we choose the ranks of the blocks in each level, subject to the total rank having a given value, which preserves the total storage needed for the MLR matrix. The final problem is to choose the hierarchical partition of rows and columns, along with the ranks and factors. This chapter is accompanied by an open-source package that implements the proposed methods.

Suggested Citation

  • Tetiana Parshakova & Trevor Hastie & Eric Darve & Stephen Boyd, 2025. "Factor Fitting, Rank Allocation, and Partitioning in Multilevel Low Rank Matrices," Springer Optimization and Its Applications,, Springer.
    • Handle: RePEc:spr:spochp:978-3-031-78369-2_9
    DOI: 10.1007/978-3-031-78369-2_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-031-78369-2_9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.