Solving Large-Scale Asymmetric Sparse Linear Equations Based on SuperLU Algorithm

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 230-232)

Edited by:

Ran Chen and Wenli Yao

Pages:

1355-1361

DOI:

10.4028/www.scientific.net/AMR.230-232.1355

Citation:

P. Wang et al., "Solving Large-Scale Asymmetric Sparse Linear Equations Based on SuperLU Algorithm", Advanced Materials Research, Vols. 230-232, pp. 1355-1361, 2011

Online since:

May 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.