A Sparse QS-Decomposition for Large Sparse Linear System of Equations

被引：2

作者：

Peng, Wujian ^{[1
]}

Datta, Biswa N. ^{[2
]}

机构：

[1] Zhaoqing Univ, Dept Math, Zhaoqing, Peoples R China

[2] Northern Illinois Univ, Dept Math, De Kalb, IL 60115 USA

来源：

DOMAIN DECOMPOSITION METHODS IN SCIENCE AND ENGINEERING XIX | 2011年 / 78卷

关键词：

D O I：

10.1007/978-3-642-11304-8_50

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

A direct solver for large scale sparse linear system of equations is presented in this paper. As a direct solver, this method is among the most efficient direct solvers available so far with flop count as O(n logn) in one-dimensional situations and O(n(3/2)) in second dimensional situation. This method has advantages over the existing fast solvers in which it can be used to handle more general situations, both well-conditioned or ill-conditioned systems; more importantly, it is a very stable solver and a naturally parallel procedure! Numerical experiments are presented to demonstrate the efficiency and stability of this algorithm.

引用

页码：431 / +

页数：2

共 7 条

[1] An asynchronous parallel supernodal algorithm for sparse Gaussian elimination [J].