Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Rank-structured matrices"”.

  1. The proxy point method for rank-structured matrices

    Rank-structured matrix representations, e.g., $\mathcal{H}^2$ and HSS, are commonly used to reduce computation and storage cost for dense matrices defined by interactions between many bodies. The main bottleneck for their application is the expensive computation required to represent a matrix in a …

    gatech Repository record for The proxy point method for rank-structured matrices (opens in a new tab)

  2. Randomized algorithms for revealing hidden structure in data-sparse matrices

    … of efficient algorithms for handling large dense matrices that have rank-structure. To simplify slightly, this means that they can be tessellated into O(N) submatrices in such a way that each submatrix is either small, or of numerically low rank. A matrix that is rank-structured can be stored …

    texas Repository record for Randomized algorithms for revealing hidden structure in data-sparse matrices (opens in a new tab)