On the Relation between the AINV and the FAPINV Algorithms | Zendy

Davod Khojasteh Salkuyeh | Zendy; Hadi Roohani Ghehsareh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the Relation between the AINV and the FAPINV Algorithms

Author(s) -

Davod Khojasteh Salkuyeh,

Hadi Roohani Ghehsareh

Publication year - 2009

Publication title -

international journal of mathematics and mathematical sciences

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 39

eISSN - 1687-0425

pISSN - 0161-1712

DOI - 10.1155/2009/179481

Subject(s) - mathematics , inverse , computation , algorithm , matrix (chemical analysis) , relation (database) , inverse problem , field (mathematics) , computer science , pure mathematics , mathematical analysis , materials science , geometry , database , composite material

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 thedependence of the computations of the inverse factors in the FAPINV algorithm results in the AINV algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research