1887

Abstract

Summary

Reservoir models can easily incorporate millions or even billions of unknowns. Algebraic multigrid (AMG) methods are often the standard choice as iterative solvers or preconditioners for the solution of the resulting linear systems. These comprise a family of techniques built on a hierarchy of levels associated with decreasingsize problems. In this way, optimality and efficiency are achieved by combining two complementary processes, i.e. relaxation and coarse-grid correction. One of the key factors defining a fast AMG method consists of capturing accurately the near-null space of the system matrix for the construction of suitable prolongation operators.

In this work, we propose a novel AMG package, aSP-AMG, where aSP means “adaptive Smoothing and Prolongation” and the “adaptive” attribute implies that we follow the perspective of adaptive and bootstrap AMG. We construct a space of smooth vectors of limited size (test space) using the Lanczos method and introduce the factorized sparse approximate inverse (FSAI) as a smoother. This improves the smoothing capabilities of the aSP-AMG as FSAI is more effective than Jacobi and much sparser than Gauss-Seidel. Moreover, FSAI has been shown to be strongly scalable. The coarsening phase is carried out as in classical AMG, but the strength of connection is computed by means of the affinity based on the test space. Finally, three new techniques are developed for building the prolongation operator: i) ABF, running few iterations of the aFSAI algorithm; ii) LS-ABF, updating the ABF coefficients with a least squares minimization; iii) DPLS, considering a least-squares process only.

The aSP-AMG performance is assessed through the solution of reservoir engineering problems including both fluid flow and geomechanical test cases. Comparisons are made with the FSAI and BoomerAMG preconditioners, showing that the new method is generally superior to both approaches.

Loading

Article metrics loading...

/content/papers/10.3997/2214-4609.201802121
2018-09-03
2024-03-28
Loading full text...

Full text loading...

References

  1. Benzi, M.
    [2002] Preconditioning Techniques for Large Linear Systems: A Survey. Journal of Computational Physics, 182(2), 418–477.
    [Google Scholar]
  2. Benzi, M., Meyer, C.D. and TÅŕma, M.
    [1996] A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method. SIAM Journal on Scientific Computing, 17(5), 1135–1149.
    [Google Scholar]
  3. Brandt, A., Brannick, J., Kahl, K. and Livshits, I.
    [2011] Bootstrap AMG. SIAM Journal on Scientific Computing, 33(2), 612–632.
    [Google Scholar]
  4. [2015] Bootstrap Algebraic Multigrid: Status Report, Open Problems, and Outlook. Numerical Mathematics: Theory, Methods and Applications, 8(1), 112–135.
    [Google Scholar]
  5. Brezina, M., Falgout, R., MacLachlan, S., Manteuffel, T., McCormick, S. and Ruge, J.
    [2006] Adaptive Algebraic Multigrid. SIAM Journal on Scientific Computing, 27(4), 1261–1286.
    [Google Scholar]
  6. Brezina, M., Ketelsen, C., Manteuffel, T., McCormick, S., Park, M. and Ruge, J.
    [2012] Relaxation-corrected Bootstrap Algebraic Multigrid (rBAMG). Numerical Linear Algebra with Applications, 19(2), 178–193.
    [Google Scholar]
  7. Christie, M., Blunt, M. et al.
    [2001] Tenth SPE comparative solution project: A comparison of upscaling techniques. In: SPE Reservoir Simulation Symposium. Society of Petroleum Engineers.
    [Google Scholar]
  8. Davis, T.A. and Hu, Y.
    [2011] The University of Florida Sparse Matrix Collection.ACM Trans. Math. Softw., 38(1), 1:1–1:25.
    [Google Scholar]
  9. Dolean, V., Jolivet, P. and Nataf, F.
    [2015] An Introduction to Domain Decomposition Methods: Algorithms, Theory and Parallel Implementation. SIAM.
    [Google Scholar]
  10. Falgout, R.D. and Yang, U.M.
    [2002] hypre: a Library of High Performance Preconditioners. In: Pre-conditioners, Lecture Notes in Computer Science.632–641.
    [Google Scholar]
  11. Franceschini, A., Paludetto Magri, V.A., Ferronato, M. and Janna, C.
    [2017] A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices.SIAM Journal on Matrix Analysis and Applications.
    [Google Scholar]
  12. Grote, M.J. and Huckle, T.
    [1997] Parallel Preconditioning with Sparse Approximate Inverses. SIAM Journal on Scientific Computing, 18(3), 838–853.
    [Google Scholar]
  13. Huckle, T.
    [2003] Factorized Sparse Approximate Inverses for Preconditioning.The Journal of Super-computing, 25, 109–117.
    [Google Scholar]
  14. Janna, C. and Ferronato, M.
    [2011] Adaptive Pattern Research for Block FSAI Preconditioning. SIAM Journal on Scientific Computing, 33(6), 3357–3380.
    [Google Scholar]
  15. Janna, C., Ferronato, M., Sartoretto, F. and Gambolati, G.
    [2015] FSAIPACK: A Software Package for High-Performance Factored Sparse Approximate Inverse Preconditioning.ACM Trans. Math. Softw., 41(2), 10:1–10:26.
    [Google Scholar]
  16. Li, R. and Saad, Y.
    [2017] Low-Rank Correction Methods for Algebraic Domain Decomposition Pre-conditioners. SIAM Journal on Matrix Analysis and Applications, 38(3), 807–828.
    [Google Scholar]
  17. Livne, O.E. and Brandt, A.
    [2012] Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver. SIAM Journal on Scientific Computing, 34(4), B499–B522.
    [Google Scholar]
  18. Olson, L.N., Schroder, J.B. and Tuminaro, R.S.
    [2011] A General Interpolation Strategy for Algebraic Multigrid Using Energy Minimization. SIAM Journal on Scientific Computing, 33(2), 966–991.
    [Google Scholar]
  19. Saad, Y.
    [1994] ILUT: a Dual Threshold Incomplete LU Factorization. Numerical Linear Algebra with Applications, 1(4), 387–402.
    [Google Scholar]
  20. [2011] Numerical Methods for Large Eigenvalue Problems. Society for Industrial and Applied Mathematics.
    [Google Scholar]
  21. Xu, J. and Zikatanov, L.
    [2017] Algebraic multigrid methods.Acta Numerica, 26, 591–721.
    [Google Scholar]
  22. Yang, U.M.
    [2006] Parallel Algebraic Multigrid Methods — High Performance Preconditioners.SpringerBerlin Heidelberg, Berlin, Heidelberg, 209–236.
    [Google Scholar]
http://instance.metastore.ingenta.com/content/papers/10.3997/2214-4609.201802121
Loading
/content/papers/10.3997/2214-4609.201802121
Loading

Data & Media loading...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error