pARMS

pARMS: A package for solving general sparse linear systems on parallel computers This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solution of linear systems arising from realistic scientific and engineering applications. The most common parallel preconditioners used for sparse linear systems adapt domain decomposition concepts to the more general framework of “distributed sparse linear systems”. The parallel Algebraic Recursive Multilevel Solver (pARMS) is a recently developed package which integrates together variants from both Schwarz procedures and Schur complement-type techniques. This paper discusses a few of the main ideas and design issues of the package. A few details on the implementation of pARMS are provided.


References in zbMATH (referenced in 31 articles , 1 standard article )

Showing results 1 to 20 of 31.
Sorted by year (citations)

1 2 next

  1. Li, Ruipeng; Saad, Yousef: Low-rank correction methods for algebraic domain decomposition preconditioners (2017)
  2. Xi, Yuanzhe; Saad, Yousef: A rational function preconditioner for indefinite sparse linear systems (2017)
  3. Chen, Jie; McInnes, Lois C.; Zhang, Hong: Analysis and practical use of flexible biCGStab (2016)
  4. Ferronato, M.; Janna, C.; Pini, G.: Shifted FSAI preconditioners for the efficient parallel solution of non-linear groundwater flow models (2012)
  5. Kalinkin, A.A.; Laevskij, Yu.M.: Iterative solver for systems of linear equations with a sparse stiffness matrix for clusters (2012)
  6. Maclachlan, S.; Osei-Kuffuor, D.; Saad, Yousef: Modification and compensation strategies for threshold-based incomplete factorizations (2012)
  7. Aliaga, José I.; Bollhöfer, Matthias; Martín, Alberto F.; Quintana-Ortí, Enrique S.: Exploiting thread-level parallelism in the iterative solution of sparse linear systems (2011)
  8. Tang, Jok M.; Saad, Yousef: Domain-decomposition-type methods for computing the diagonal of a matrix inverse (2011)
  9. D’Ambra, Pasqua; Di Serafino, Daniela; Filippone, Salvatore: MLD2P4: a package of parallel algebraic multilevel domain decomposition preconditioners in Fortran 95 (2010)
  10. Giraud, L.; Haidar, A.; Saad, Y.: Sparse approximations of the Schur complement for parallel algebraic hybrid solvers in 3D (2010)
  11. Osei-Kuffuor, Daniel; Saad, Yousef: Preconditioning Helmholtz linear systems (2010)
  12. Bonfiglioli, A.; Carpentieri, B.; Sosonkina, M.: Performance analysis of parallel algebraic preconditioners for solving the RANS equations using fluctuation splitting schemes (2008)
  13. Bergamaschi, L.; Gambolati, G.; Pini, G.: A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations (2007)
  14. Hénon, Pascal; Saad, Yousef: A parallel multistage ILU factorization based on a hierarchical graph decomposition (2006)
  15. Kendall, Ricky A.; Sosonkina, Masha; Gropp, William D.; Numrich, Robert W.; Sterling, Thomas: Parallel programming models applicable to cluster computing and beyond (2006)
  16. Li, Na; Saad, Yousef: MIQR: a multilevel incomplete QR preconditioner for large sparse least-squares problems (2006)
  17. Li, Zhongze; Saad, Yousef: SchurRAS: A restricted version of the overlapping Schur complement preconditioner (2006)
  18. Mayer, Jan: Alternative weighted dropping strategies for ILUTP (2006)
  19. Yang, Ulrike Meier: Parallel algebraic multigrid methods -- high performance preconditioners (2006)
  20. Bergamaschi, Luca; Martínez, Ángeles: Parallel acceleration of Krylov solvers by factorized approximate inverse preconditioners (2005)

1 2 next