WSMP : Watson Sparse Matrix Package Part III – iterative solution of sparse systems Version 18 . 06

@inproceedings{Gupta2017WSMPW,
  title={WSMP : Watson Sparse Matrix Package Part III – iterative solution of sparse systems Version 18 . 06},
  author={Anshul Gupta},
  year={2017}
}

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A Restarted GMRES Method Augmented with Eigenvectors

SIAM J. Matrix Analysis Applications • 1995
View 3 Excerpts
Highly Influenced

and Jacko Koster . On algorithms for permuting large entries to the diagonal of a sparse matrix

Iain S. Duff
SIAM Journal on Matrix Analysis and Applications • 2001

On algorithms for finding maximum matchings in bipartite graphs

Anshul Gupta, Lexing Ying
1999

On algorithms for finding maximum matchings in bipartite graphs. Technical Report RC 21576

Anshul Gupta, Lexing Ying
IBM T. J. Watson Research • 1999
View 4 Excerpts

Demmel . Making sparse Gaussian elimination scalable by static pivoting

Xiaoye S. Li
1998

Making Sparse Gaussian Elimination Scalable by Static Pivoting

Proceedings of the IEEE/ACM SC98 Conference • 1998
View 3 Excerpts

Fast and effective algorithms for graph partitioning and sparse-matrix ordering

IBM Journal of Research and Development • 1997
View 3 Excerpts

A New Pivoting Strategy for Gaussian Elimination

Markus Olschowka
1996
View 2 Excerpts

Similar Papers

Loading similar papers…