Parallel sparsified solvers for reservoir simulation

ECMOR 2010 - 12th European Conference on the Mathematics of Oil Recovery

Volumn , Issue , 2010, Pages

  Klie, H M ^a  

^a ConocoPhillips ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; SOLVENTS;

ALGEBRAIC MULTIGRIDS; COMPOSITIONAL SIMULATIONS; FLOATING POINT OPERATIONS; ORDERS OF MAGNITUDE; PROBABILITY PROPORTIONAL; RESERVOIR SIMULATION; SOLUTION PROCESS; SYSTEM COEFFICIENTS;

LINEAR SYSTEMS;

EID: 85085779730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3997/2214-4609.20144960     Document Type: Conference Paper

References (21)

1. D. Achlioptas and F. McSherry. Fast Computation of Low-Rank Approximations. J ACM 54 (2): 1-19 2007.
2. B. Aksoylu I.G. Graham H. Klie and R. Scheichl. Towards a Rigorously Justified Algebraic Preconditioner for High-Contrast Diffusion Problems. Computing and Visualizacion in Science. In print 2008.
3. A. Al-Futaisi and T.W. Patzek. Extension of Hoshen-Kopelman Algorithm to Non-Lattice Environments. Physica A 321: 665-678 2003.
4. S. Arora E. Hazan and S. Kale. A Fast Random Sampling Algorithm for Sparsifying Matrices. In Approx-Random'06 Lecture Notes in Computer Science 4110: 272-279 2006.
5. E.G. Boman and B. Hendrickson. Support Theory for Preconditioning. SIAM J. Matrix Anal. Appl. 25(3): 649-717 2003.
6. D. Chen and S. Toledo. Vaidya's Preconditioners: Implementation and Experimental Study Electron. Trans. Numer. Anal. 16: 30-49 2003.
7. P.G. Doyle and J.L. Snell. Random Walks and Electrical Networks Carus Math. Monograph Vol. 22 Mathematical Association of America 2000.
8. A. Frieze R. Kannan S. Vempala. Fast Monte Carlo Algorithms for Finding Low-Rank Approximations. J. ACM 51 (6): 1025-1041 2004.
9. D. Jungnickel. Graph Networks and Algorithms. Springer-Verlag 3er. Edition 2008.
10. A. Kansal and S. Torquato. Globally and Locally Minimal Weight Spanning Tree Networks. Physica A 301: 601-619 2001.
11. H. Klie J. Monteagudo H. Hoteit and A. Rodriguez. Towards a New Generation of Physics-Driven Solvers for Black-Oil and Compositional Flow Simulation. SPE Reservoir Simulation Symposium SPE paper N. 118752 The Woodlands Feb. 2-4 2009.
12. I. Koutis and G. L. Miller. A linear work time parallel algorithm for solving planar Laplacians. In Proc. 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007) 2007.
13. I. Koutis and G. L. Miller. Graph partitioning into isolated high conductance clusters: Theory computation and applications to preconditioning. Symposiun on Parallel Algorithms and Architectures (SPAA) 2008.
14. A. Kolla and Y. Makarychev A. Saberi and S. Teng. Subgraph Sparsification and nearly Optimal Ultrasparsifiers. CoRR Journal abs/0912.1623 2009.
15. M. Rudelson and R. Vershynin. Sampling from Large Matrices: An Approach through Geometrical Functional Analysis. J. ACM 54 (4): 21 2007.
16. Y. Saad. Iterative Methods for Sparse Linear Systems. SIAM 2nd. Edition Philadelphia 2003.
17. M.A. Serrano M. Boguna and A. Vespignani. Estracting the Multiscale Backbone of Complex Weighted Networks. PNAS 106 (12) 6483-6488 2009.
18. R. Shuttleworth S. Maliassov. Partitioners for Parallelizing Reservior Simulations. SPE Reservoir Simulation Symposium SPE paper N. 118752 The Woodlands Texas Feb. 2-4 2009.
19. D.A. Spielman and N. Srivastava. Graph Sparsification by Effective Resistances. CoRR Journal abs/0803.0929 2008.
20. D.A. Spielman and S.-H. Teng. Nearly-linear time algorithms for preconditioning and solving symmetric diagonally dominant linear systems. CoRR Journal abs/cs/0607105 2006.
21. P. M. Vaidya. Solving linear equations with symmetric diagonally dominant matrices by constructing good preconditioners. Unpublished manuscript UIUC 1990. A talk based on the manuscript was presented at the IMA Workshop on Graph Theory and Sparse Matrix Computation October 1991 Minneapolis 1990.