Concepedia

Randomized Matrix Algorithms

Randomized Matrix Algorithms is a class of computational methods that employ randomness as a fundamental mechanism to achieve efficient approximation or decomposition of matrix operations, distinguishing itself from deterministic linear algebra techniques by leveraging probabilistic constructs to reduce complexity in high-dimensional settings.

320

Publications

23.8K

Citations

503

Authors

233

Institutions

Publications per year

2017–2026

88

Parents

Publications

320

Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

Nathan Halko, Per‐Gunnar Martinsson, Joel A. Tropp · SIAM Review · 2011 · 4.1K citations

, , +16

Matrix Completion From a Few Entries

Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh · IEEE Transactions on Information Theory · 2010 · 1K citations

, , +16

Matrix completion from a few entries

Raghunandan H. Keshavan, Sewoong Oh, Andrea Montanari · 2009 · 662 citations

, , +16

Randomized algorithms for the low-rank approximation of matrices

Edo Liberty, Franco Woolfe, Per‐Gunnar Martinsson et al. · Proceedings of the National Academy of Sciences · 2007 · 570 citations · Full text

, , +16

Algorithm AS 159: An Efficient Method of Generating Random R × C Tables with Given Row and Column Totals

W. M. Patefield · Journal of the Royal Statistical Society Series C (Applied Statistics) · 1981 · 514 citations

, , +12

1–5 of 320

Authors

503

  1. DP
    David P. Woodruff

    IBM Research - Almaden, United States

    18 publications · 1.5K citations

    15

    h-index

  2. PM
    Per‐Gunnar Martinsson

    University of Colorado Boulder, United States

    13 publications · 5.4K citations

    12

    h-index

  3. PD
    Petros Drineas

    Rensselaer Polytechnic Institute, United States

    14 publications · 1.8K citations

    12

    h-index

  4. MW
    Michael W. Mahoney

    University of California, Berkeley, United States

    13 publications · 1.9K citations

    12

    h-index

  5. CB
    Christos Boutsidis

    Rensselaer Polytechnic Institute, United States

    11 publications · 933 citations

    11

    h-index

1–5 of 503

Institutions

233

  1. Stanford University

    Stanford, United States

    18 h-index

    43 publications

    7.7K citations

  2. Rensselaer Polytechnic Institute

    Troy, United States

    11 h-index

    18 publications

    2.4K citations

  3. IBM Research - Almaden

    San Jose, United States

    11 h-index

    13 publications

    986 citations

  4. University of California, Berkeley

    Berkeley, United States

    11 h-index

    21 publications

    513 citations

  5. Yale University

    New Haven, United States

    10 h-index

    19 publications

    4K citations

  6. California Institute of Technology

    Pasadena, United States

    9 h-index

    12 publications

    471 citations

  7. IBM (United States)

    Armonk, United States

    9 h-index

    12 publications

    1.6K citations

  8. University of Waterloo

    Waterloo, Canada

    8 h-index

    12 publications

    395 citations

1–8 of 233

Venues

  1. 20

    h-index

  2. arXiv (Cornell University)

    Repository · 45 publications · 1.5K citations

    19

    h-index

  3. Linear Algebra and its Applications

    12 publications · 510 citations

    12

    h-index

  4. SIAM Journal on Scientific Computing

    10 publications · 593 citations

    10

    h-index

  5. ArXiv.org

    Repository · 6 publications · 248 citations

    6

    h-index

1–5