Sparsity Pattern Optimization
Sparsity Pattern Optimization is a computational method in finite volume reservoir simulation that identifies and exploits the optimal arrangement of non-zero elements in sparse Jacobian or coefficient matrices to minimize fill-in, reduce computational overhead, and accelerate linear solver convergence during numerical simulations.
30
Publications
1K
Citations
94
Authors
53
Institutions
Publications per year
2017–2026
19
30
Positive semidefinite matrices with a given sparsity pattern
Jim Agler, William Helton, Scott McCullough et al. · Linear Algebra and its Applications · 1988 · 120 citations
Dynamic Model Pruning with Feedback
Tao Lin, Sebastian U. Stich, Luis Barba et al. · arXiv (Cornell University) · 2020 · 87 citations · Full text
1–5 of 30
94
2
h-index
École Polytechnique Fédérale de Lausanne, Switzerland
2 publications · 102 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 94
53
ETH Zurich
Zurich, Switzerland
3 h-index
6 publications
130 citations
Harvard University
Cambridge, United States
2 h-index
2 publications
58 citations
University of Oxford
Oxford, United Kingdom
2 h-index
3 publications
105 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
2 h-index
2 publications
37 citations
The Ohio State University
Columbus, United States
1 h-index
3 publications
90 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
1 h-index
1 publications
21 citations

University of Victoria
Victoria, Canada
1 h-index
1 publications
12 citations

Wrocław University of Science and Technology
Wroclaw, Poland
1 h-index
3 publications
78 citations
1–8 of 53
Repository · 2 publications · 101 citations
2
h-index
1 publications · 68 citations
1
h-index
1 publications · 120 citations
1
h-index
1 publications · 21 citations
1
h-index
1 publications · 18 citations
1
h-index
1–5