Abstract
This article introduces the recent research of SuperLU algorithms and the optimal storage method for [1] the sparse linear equations of coefficient matrix. How to solve large-scale non-symmetric sparse linear equations by SuperLU algorithm is the key part of this article. The advantage of SuperLU algorithm compared to other algorithms is summarized at last. SuperLU algorithm not only saves memory space, but also reduces the computation time. Because of less storage needed by this algorithm, it could solve equation with larger scale, which is much more useful.
Publisher
Trans Tech Publications, Ltd.
Reference10 articles.
1. Qu Changzheng, Kang jing. Nonlocal Symmetries to Systems of Nonlinear Diffusion Equations, Communications in Theoretical Physics, Vol. 49, No. 1, 9-16, (2008).
2. Zhang Tan'e, Sun Jianping, Wang Xizhao. A Method to Solve Systems of Fuzzy Linear Equations, Chinese quarterly Journal of mathematics, Vol. 13, No. 4, 106-110, (1998).
3. Chen Zhiming. Numerical Mathematics, A Journal of Chinese Universities Numer. Math.J. Chinese Univ, issue2, Vol. 16, No4, 164-170, (2007).
4. Wu Min, He Bei, She Jinhua. A Fast LDL-factorization Approach for Large Sparse Positive Definite System and Its Application to One-to-one Marketing Optimization, International Journal of Automation and Computing, Vol. 04, No1, 88-94, (2007).
5. James W. Demmel, John R. Gilbert, Xiaoye S. Li. SuperLU Users' Guide, (1999).