Sparse Matrix Techniques

Sparse Matrix Techniques is a computational methodology within numerical linear algebra that exploits the low density of non-zero elements in matrices to optimize storage, manipulation, and solution processes in large-scale systems of equations arising in nodal analysis.

2.8K

Publications

207.4K

Citations

4.8K

Authors

1.4K

Institutions

Publications per year

2017–2026

386

Authors

4.8K

  1. ID
    Iain Duff

    Rutherford Appleton Laboratory, United Kingdom

    35 publications · 5.1K citations

    26

    h-index

  2. YS
    Yousef Saad

    University of Minnesota, United States

    29 publications · 2.3K citations

    20

    h-index

  3. JR
    John Reid

    Rutherford Appleton Laboratory, United Kingdom

    19 publications · 3.2K citations

    18

    h-index

  4. JW
    Joseph W. H. Liu

    York University, Canada

    20 publications · 2.3K citations

    18

    h-index

  5. ZB
    Zhong‐Zhi Bai

    Chinese Academy of Sciences, China

    18 publications · 3K citations

    17

    h-index

1–5 of 4.8K

Venues

  1. SIAM Journal on Scientific Computing

    117 publications · 10.3K citations

    52

    h-index

  2. SIAM Journal on Matrix Analysis and Applications

    151 publications · 11.4K citations

    49

    h-index

  3. ACM Transactions on Mathematical Software

    TOMS · 61 publications · 13.6K citations

    41

    h-index

  4. Linear Algebra and its Applications

    143 publications · 5.8K citations

    37

    h-index

  5. Mathematics of Computation

    MCOM · 48 publications · 10K citations

    30

    h-index

1–5