The Watson Symmetric Sparse Matrix Package WSSMP is a robust high performance software for solving large sparse symmetric positive definite systems of linear equations on modern work-station class computers. It uses a modified version of the multifrontal algorithm [7] for sparse Cholesky factorization. The current release of WSSMP can perform any or all of the following tasks: ordering, symbolic factorization, Cholesky factorization, triangular solves, and iterative refinement. We hope to enhance the functionality in the future, such as, the inclusion of LDL(T) factorization for semidefinite and indefinite matrices. A parallel version incorporating a highly scalable sparse factorization algorithm [5,3] and parallel triangular solver [6,3] will also be released sometime in the futre. The next serial release will have a simple interface with limited options, in addition to the interface described in this manual, which is primarily aimed at sophisticated users.
By: Anshul Gupta and Fred Gustavson
Published in: RC20645 in 1996
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .