WSMP: A high-performance serial and parallel sparse linear solver Watson Sparse Matrix Package (WSMP) is a collection of algorithms for efficiently solving large systems of linear equations whose coefficient matrices are sparse. This high-performance, robust, and easy-to-use software can be used as a serial package, or in a shared-memory multiprocessor environment, or as a scalable parallel solver in a message-passing environment, where each node can either be a uniprocessor or a shared-memory multiprocessor

References in zbMATH (referenced in 26 articles )

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

1 2 next

  1. Amestoy, Patrick; Ashcraft, Cleve; Boiteau, Olivier; Buttari, Alfredo; L’Excellent, Jean-Yves; Weisbecker, Clément: Improving multifrontal methods by means of block low-rank representations (2015)
  2. Gould, Nicholas I.M.; Orban, Dominique; Robinson, Daniel P.: Trajectory-following methods for large-scale degenerate convex quadratic programming (2013)
  3. Hogg, Jonathan D.; Scott, Jennifer A.: Pivoting strategies for tough sparse indefinite systems (2013)
  4. Janna, Carlo; Ferronato, Massimilano; Gambolati, Giuseppe: Enhanced block FSAI preconditioning using domain decomposition techniques (2013)
  5. Ho, Kenneth L.; Greengard, Leslie: A fast direct solver for structured linear systems by recursive skeletonization (2012)
  6. Lubin, Miles; Petra, Cosmin G.; Anitescu, Mihai: The parallel solution of dense saddle-point linear systems arising in stochastic programming (2012)
  7. Jog, C.S.; Pal, R.K.: A monolithic strategy for fluid -- structure interaction problems (2011)
  8. Lin, Lin; Yang, Chao; Lu, Jianfeng; Ying, Lexing; E, Weinan: A fast parallel algorithm for selected inversion of structured sparse matrices with application to 2D electronic structure calculations (2011)
  9. Gupta, Anshul; George, Thomas: Adaptive techniques for improving the performance of incomplete factorization preconditioning (2010)
  10. Hogg, J.D.; Reid, J.K.; Scott, J.A.: Design of a multicore sparse Cholesky factorization using DAGs (2010)
  11. Jog, C.S.; Kumar, Rakesh: Shortcomings of discontinuous-pressure finite element methods on a class of transient problems (2010)
  12. Herrero, José R.; Navarro, Juan J.: Hypermatrix oriented supernode amalgamation (2008)
  13. Gupta, Anshul: A shared- and distributed-memory parallel general sparse direct solver (2007)
  14. Steinsland, Ingelin: Parallel exact sampling and evaluation of Gaussian Markov random fields (2007)
  15. Bollhöfer, Matthias; Schenk, Olaf: Combinatorial aspects in sparse elimination methods (2006)
  16. Salahi, Maziar; Terlaky, Tamás; Zhang, Guoqing: The complexity of self-regular proximity based infeasible IPMs (2006)
  17. Fašangová, Eva; Miana, Pedro J.: Spectral mapping inclusions for the Phillips functional calculus in Banach spaces and algebras (2005)
  18. Mészáros, C.: The Cholesky factorization in interior point methods (2005)
  19. Mészáros, Csaba: On the performance of the Cholesky factorization in interior point methods on Pentium 4 processors (2005)
  20. Sun, Jun; Michaleris, Pan; Gupta, Anshul; Raghavan, Padma: A fast implementation of the FETI-DP method: FETI-DP-RBS-LNA and applications on large scale problems with localized non-linearities (2005)

1 2 next