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

Authors

94

  1. DD
    Daniil Dmitriev

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 102 citations

    2

    h-index

  2. SU
    Sebastian U. Stich

    École Polytechnique Fédérale de Lausanne, Switzerland

    2 publications · 102 citations

    2

    h-index

  3. AP
    Antonis Papachristodoulou

    University of Oxford, United Kingdom

    2 publications · 71 citations

    2

    h-index

  4. LF
    Luca Furieri

    ETH Zurich, Switzerland

    2 publications · 53 citations

    2

    h-index

  5. MK
    Maryam Kamgarpour

    ETH Zurich, Switzerland

    2 publications · 53 citations

    2

    h-index

1–5 of 94

Venues

  1. arXiv (Cornell University)

    Repository · 2 publications · 101 citations

    2

    h-index

  2. Mathematical Programming Computation

    1 publications · 68 citations

    1

    h-index

  3. Linear Algebra and its Applications

    1 publications · 120 citations

    1

    h-index

  4. IEEE Transactions on Industrial Electronics

    1 publications · 21 citations

    1

    h-index

  5. Optimization Letters

    1 publications · 18 citations

    1

    h-index

1–5