A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A Sparse QS-Decomposition for Large Sparse Linear System of Equations
[chapter]
2010
Lecture Notes in Computational Science and Engineering
Preserved Fulltext
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
doi:10.1007/978-3-642-11304-8_50
fatcat:3rvnz2dqmvcvvbfg2tvfrlwpqy