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 30 articles )

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

1 2 next

  1. Gupta, Anshul: Enhancing performance and robustness of ILU preconditioners by blocking and selective transposition (2017)
  2. Wan, Wei; Biegler, Lorenz T.: Structured regularization for barrier NLP solvers (2017)
  3. Hogg, Jonathan D.; Ovtchinnikov, Evgueni; Scott, Jennifer A.: A sparse symmetric indefinite direct solver for GPU architectures (2016)
  4. 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)
  5. Gould, Nicholas I.M.; Orban, Dominique; Robinson, Daniel P.: Trajectory-following methods for large-scale degenerate convex quadratic programming (2013)
  6. Hogg, Jonathan D.; Scott, Jennifer A.: Pivoting strategies for tough sparse indefinite systems (2013)
  7. Janna, Carlo; Ferronato, Massimilano; Gambolati, Giuseppe: Enhanced block FSAI preconditioning using domain decomposition techniques (2013)
  8. Ho, Kenneth L.; Greengard, Leslie: A fast direct solver for structured linear systems by recursive skeletonization (2012)
  9. Lubin, Miles; Petra, Cosmin G.; Anitescu, Mihai: The parallel solution of dense saddle-point linear systems arising in stochastic programming (2012)
  10. Jog, C.S.; Pal, R.K.: A monolithic strategy for fluid -- structure interaction problems (2011)
  11. 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)
  12. Lin, Lin; Yang, Chao; Meza, Juan C.; Lu, Jianfeng; Ying, Lexing; E, Weinan: SelInv -- an algorithm for selected inversion of a sparse symmetric matrix (2011)
  13. Gupta, Anshul; George, Thomas: Adaptive techniques for improving the performance of incomplete factorization preconditioning (2010)
  14. Hogg, J.D.; Reid, J.K.; Scott, J.A.: Design of a multicore sparse Cholesky factorization using DAGs (2010)
  15. Jog, C.S.; Kumar, Rakesh: Shortcomings of discontinuous-pressure finite element methods on a class of transient problems (2010)
  16. Herrero, José R.; Navarro, Juan J.: Hypermatrix oriented supernode amalgamation (2008)
  17. Gupta, Anshul: A shared- and distributed-memory parallel general sparse direct solver (2007)
  18. Steinsland, Ingelin: Parallel exact sampling and evaluation of Gaussian Markov random fields (2007)
  19. Bollhöfer, Matthias; Schenk, Olaf: Combinatorial aspects in sparse elimination methods (2006)
  20. Salahi, Maziar; Terlaky, Tamás; Zhang, Guoqing: The complexity of self-regular proximity based infeasible IPMs (2006)

1 2 next