Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 2580820, 11 pages
https://doi.org/10.1155/2017/2580820
Research Article

Parallel Multiprojection Preconditioned Methods Based on Subspace Compression

Department of Electrical and Computer Engineering, School of Engineering, Democritus University of Thrace, University Campus, Kimmeria, 67100 Xanthi, Greece

Correspondence should be addressed to Christos K. Filelis-Papadopoulos; rg.htud.ee@dapapc

Received 1 February 2017; Revised 5 April 2017; Accepted 11 April 2017; Published 30 July 2017

Academic Editor: Damijan Markovic

Copyright © 2017 Byron E. Moutafis et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Saad, Iterative Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, Philadelphia, Pa, USA, 2nd edition, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  2. O. Axelsson, Iterative Solution Methods, Cambridge University Press, Cambridge, UK, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  3. J. H. Bramble, J. E. Pasciak, and A. H. Schatz, “The construction of preconditioners for elliptic problems by substructuring I,” Mathematics of Computation, vol. 47, no. 175, pp. 103–134, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  4. X.-C. Cai and M. Sarkis, “A restricted additive Schwarz preconditioner for general sparse linear systems,” SIAM Journal on Scientific Computing, vol. 21, no. 2, pp. 792–797, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. L. M. Carvalho, L. Giraud, and G. Meurant, “Local preconditioners for two-level non-overlapping domain decomposition methods,” Numerical Linear Algebra with Applications, vol. 8, no. 4, pp. 207–227, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. T. F. Chan and T. P. Mathew, “Domain decomposition algorithms,” Acta Numerica, vol. 3, pp. 61–143, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  7. M. Dryja, B. F. Smith, and O. B. Widlund, “Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions,” SIAM Journal on Numerical Analysis, vol. 31, no. 6, pp. 1662–1694, 1994. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. B. Smith, P. Björstad, and W. Gropp, Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations, Cambridge University Press, Cambridge, UK, 1996. View at MathSciNet
  9. L. Giraud, F. Guevara Vasquez, and R. S. Tuminaro, “Grid transfer operators for highly variable coefficient problems in two-level non-overlapping domain decomposition methods,” Numerical Linear Algebra with Applications, vol. 10, no. 5-6, pp. 467–484, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. M. Manguoglu, A. H. Sameh, and O. Schenk, “PSPIKE: a parallel hybrid sparse linear system solver,” Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5704, pp. 797–808, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. A. H. Sameh and V. Sarin, “Hybrid parallel linear system solvers,” International Journal of Computational Fluid Dynamics, vol. 12, no. 3-4, pp. 213–223, 1999. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. C. Farhat and F. Roux, “A method of finite element tearing and interconnecting and its parallel solution algorithm,” International Journal for Numerical Methods in Engineering, vol. 32, no. 6, pp. 1205–1227, 1991. View at Publisher · View at Google Scholar · View at Scopus
  13. C. Farhat, M. Lesoinne, and K. Pierson, “A scalable dual-primal domain decomposition method,” Numerical Linear Algebra with Applications, vol. 7, no. 7-8, pp. 687–714, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Klawonn and O. B. Widlund, “A domain decomposition method with Lagrange multipliers and inexact solvers for linear elasticity,” SIAM Journal on Scientific Computing, vol. 22, no. 4, pp. 1199–1219, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J. Mandel, “Balancing domain decomposition,” Communications in Numerical Methods in Engineering with Biomedical Applications, vol. 9, no. 3, pp. 233–241, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. C. R. Dohrmann, “A preconditioner for substructuring based on constrained energy minimization,” SIAM Journal on Scientific Computing, vol. 25, no. 1, pp. 246–258, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. E. Agullo, L. Giraud, A. Guermouche, A. Haidar, and J. Roman, “Parallel algebraic domain decomposition solver for the solution of augmented systems,” Advances in Engineering Software, vol. 60-61, pp. 23–30, 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. Y. Zhu and A. H. Sameh, “PSPIKE+: a family of parallel hybrid sparse linear system solvers,” Journal of Computational and Applied Mathematics, vol. 311, pp. 682–703, 2017. View at Publisher · View at Google Scholar · View at MathSciNet
  19. R. Bank, R. Falgout, T. Jones, T. A. Manteuffel, S. F. McCormick, and J. W. Ruge, “Algebraic multigrid domain and range decomposition (AMG-DD/AMG-RD),” SIAM Journal on Scientific Computing, vol. 37, no. 5, pp. S113–S136, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  20. R. E. Bank and R. K. Smith, “An algebraic multilevel multigraph algorithm,” SIAM Journal on Scientific Computing, vol. 23, no. 5, pp. 1572–1592, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. W. F. Mitchell, “A parallel multigrid method using the full domain partition,” Electronic Transactions on Numerical Analysis, vol. 6, pp. 224–233, 1997. View at Google Scholar · View at MathSciNet
  22. Y. Xi, R. Li, and Y. Saad, “An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices,” SIAM Journal on Matrix Analysis and Applications, vol. 37, no. 1, pp. 235–259, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. G. Karypis and V. Kumar, “A fast and high quality multilevel scheme for partitioning irregular graphs,” SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 359–392, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. F. Pellegrini and J. Roman, “Scotch: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs,” in High-Performance Computing and Networking, vol. 1067 of Lecture Notes in Computer Science, pp. 493–498, Springer, Berlin, Germany, 1996. View at Publisher · View at Google Scholar
  25. H. Kim, J. Xu, and L. Zikatanov, “A multigrid method based on graph matching for convection-diffusion equations,” Numerical Linear Algebra with Applications, vol. 10, no. 1-2, pp. 181–195, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y. Notay, “Aggregation-based algebraic multilevel preconditioning,” SIAM Journal on Matrix Analysis and Applications, vol. 27, no. 4, pp. 998–1018, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. Y. Notay, “An aggregation-based algebraic multigrid method,” Electronic Transactions on Numerical Analysis, vol. 37, pp. 123–146, 2010. View at Google Scholar · View at MathSciNet · View at Scopus
  28. C. C. Douglas, G. Haase, and U. Langer, A Tutorial on Elliptic PDE Solvers and Their Parallelization, vol. 16 of Software, Environments, and Tools, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa, USA, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  29. Y. Saad and M. H. Schultz, “GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems,” SIAM Journal on Scientific and Statistical Computing, vol. 7, no. 3, pp. 856–869, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  30. W. Hackbusch, Iterative Solution of Large Sparse Systems of Equations, vol. 95 of Applied Mathematical Sciences, Springer-Verlag, New York, NY, USA, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  31. A. Frommer and D. B. Szyld, “An algebraic convergence theory for restricted additive Schwarz methods using weighted max norms,” SIAM Journal on Numerical Analysis, vol. 39, no. 2, pp. 463–479, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. T. A. Davis, Direct Methods for Sparse Linear Systems, SIAM, Philadelphia, Pa, USA, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  33. G. H. Golub and C. F. Van Loan, Matrix Computations, Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, Md, USA, 4th edition, 2013. View at MathSciNet
  34. B. Chapman, G. Jost, and R. van der Pas, Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation), MIT Press, Cambridge, Mass, USA.
  35. C. L. Lawson, R. J. Hanson, D. R. Kincaid, and F. T. Krogh, “Basic linear algebra subprograms for fortran usage,” ACM Transactions on Mathematical Software (TOMS), vol. 5, no. 3, pp. 308–323, 1979. View at Publisher · View at Google Scholar · View at Scopus
  36. G. Karypis and V. Kumar, “A parallel algorithm for multilevel graph partitioning and sparse matrix ordering,” Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 71–95, 1998. View at Publisher · View at Google Scholar · View at Scopus
  37. T. A. Davis and Y. Hu, “The University of Florida sparse matrix collection,” Association for Computing Machinery. Transactions on Mathematical Software, vol. 38, no. 1, 25 pages, 2011. View at Publisher · View at Google Scholar · View at MathSciNet