On the Relation between the AINV and the FAPINV Algorithms

Davod Khojasteh Salkuyeh and Hadi Roohani

International Journal of Mathematics and Mathematical Sciences, 2009, vol. 2009, 1-6

Abstract:

The approximate inverse (AINV) and the factored approximate inverse (FAPINV) are two known algorithms in the field of preconditioning of linear systems of equations. Both of these algorithms compute a sparse approximate inverse of matrix ð ´ in the factored form and are based on computing two sets of vectors which are ð ´ -biconjugate. The AINV algorithm computes the inverse factors ð ‘Š and ð ‘ of a matrix independently of each other, as opposed to the AINV algorithm, where the computations of the inverse factors are done independently. In this paper, we show that, without any dropping, removing the dependence of the computations of the inverse factors in the FAPINV algorithm results in the AINV algorithm.

Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2009/179481.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2009/179481.xml (text/xml)

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:hin:jijmms:179481

DOI: 10.1155/2009/179481

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().