Graph-based Matrix Ordering

Graph-Based Matrix Ordering is a computational method in parallel numerical linear algebra that uses graph-theoretic representations of matrices to reorder their elements, thereby minimizing fill-in and communication overhead during factorization by exploiting sparsity patterns through vertex partitioning and traversal strategies.

10

Publications

253

Citations

21

Authors

7

Institutions

Publications per year

2017–2026

1

Authors

21

  1. BC
    Bernard Carré

    Institut National de la Recherche Agronomique, Morocco

    1 publications · 10 citations

    1

    h-index

  2. TW
    Takumi Washio

    The University of Tokyo, Japan

    1 publications · 43 citations

    1

    h-index

  3. JG
    John G. Lewis

    Boeing (United States), United States

    1 publications · 40 citations

    1

    h-index

  4. OK
    Onur Küçüktunç

    The Ohio State University, United States

    1 publications · 11 citations

    1

    h-index

  5. HR
    Herschel Rabitz

    Princeton University, United States

    1 publications · 13 citations

    1

    h-index

1–5 of 21

Venues

  1. BIT Numerical Mathematics

    1 publications · 20 citations

    1

    h-index

  2. Journal of Global Optimization

    1 publications · 13 citations

    1

    h-index

  3. Social Network Analysis and Mining

    1 publications · 11 citations

    1

    h-index

  4. IEEE Transactions on Power Systems

    1 publications · 46 citations

    1

    h-index

  5. Quarterly of Applied Mathematics

    QAM · 1 publications · 24 citations

    1

    h-index

1–5