On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

Hou-Biao Li, Ting-Zhu Huang, Yong Zhang, Xing-Ping Liu and Hong Li

Mathematics and Computers in Simulation (MATCOM), 2009, vol. 79, issue 7, 2135-2147

Abstract: In this paper, to obtain an efficient parallel algorithm to solve sparse block-tridiagonal linear systems, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are suitable when the desired goal is to maximize parallelism. Moreover, some theoretical results concerning these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block tridiagonal H-matrices is also described. In addition, the validity of these preconditioners is illustrated with some numerical experiments arising from the second order elliptic partial differential equations and oil reservoir simulations.

Keywords: Tridiagonal matrix; Stair matrix; Polynomial sparse approximate; Preconditioning; Parallel algorithm (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475408003881
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:79:y:2009:i:7:p:2135-2147

DOI: 10.1016/j.matcom.2008.09.009

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().