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
Parents
2.8K
Numerical methods for least squares problems
Choice Reviews Online · 1996 · 3.1K citations
Sparse Approximate Solutions to Linear Systems
B. K. Natarajan · SIAM Journal on Computing · 1995 · 2.8K citations
1–5 of 2.8K
4.8K
26
h-index
20
h-index
18
h-index
18
h-index
17
h-index
1–5 of 4.8K
1.4K
Stanford University
Stanford, United States
32 h-index
92 publications
19.5K citations

Chinese Academy of Sciences
Beijing, China
28 h-index
82 publications
7.4K citations
The University of Texas at Austin
Austin, United States
24 h-index
56 publications
3.9K citations
University of Illinois Urbana-Champaign
Urbana, United States
23 h-index
83 publications
3.6K citations

Rutherford Appleton Laboratory
Didcot, United Kingdom
22 h-index
45 publications
2.6K citations
University of California, Berkeley
Berkeley, United States
19 h-index
52 publications
3.1K citations

University of Minnesota
Minneapolis, United States
19 h-index
39 publications
2.7K citations
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
46 publications
4.8K citations
1–8 of 1.4K
117 publications · 10.3K citations
52
h-index
151 publications · 11.4K citations
49
h-index
TOMS · 61 publications · 13.6K citations
41
h-index
143 publications · 5.8K citations
37
h-index
MCOM · 48 publications · 10K citations
30
h-index
1–5