@Article{CAM-6-21, author = {}, title = {免费软件介绍: GSS_spd: fast sparse solver for symmetric positive definite matrices}, journal = {CAM-Net Digest}, year = {2009}, volume = {6}, number = {21}, pages = {6--6}, abstract = {

主题： GSS_spd: fast sparse solver for symmetric positive definite matrices

GSS_spd是国产的数学库，现免费发布。望能支持并发表到CAM Digest中。以下是简介：

GSS_spd is a novel sparse solver for symmetric positive definite matrices. GSS_spd isabout 20% faster than PARDISO in numerical factorization. The result is based on nearly all the large SPD matrices (with more than 300,000 unknowns) from UF sparse matrix collection, which are indisputably authoritative and representative.

The testing CPU is Intel Q8200, which is cheap now. And the average numerical factorization time is less than 10 seconds! So it's easy and fast to solve million SPD matrices in PC.
A free version for 64 bit windows is available at http://www.grusoft.com/GSS_spd.htm.
It also includes the detail of experimental results and C,Fortran demo.

}, issn = {}, doi = {https://doi.org/2009-CAM-16504}, url = {https://global-sci.com/article/78479/gss-spd-fast-sparse-solver-for-symmetric-positive-definite-matrices} }