Title : ( A sparse-sparse iteration for computing a sparse incomplete )
Authors: داوود خجسته سالکویه , Faezeh Toutounian Mashhad ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
Abstract In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a preconditioner for solving symmetric positive definite linear systems of equations by using the preconditioned conjugate gradient algorithm. Some numerical experiments on test matrices from the Harwell–Boeing collection for comparing the numerical performance of the presented method with one available well-known algorithm are also given.
Keywords
Keywords: Sparse matrices; Factorized sparse approximate inverse; Preconditioning; Krylov subspace methods; Symmetric positive definite; Preconditioned CG algorithm
@article{paperid:1010870,
author = {داوود خجسته سالکویه and Toutounian Mashhad, Faezeh},
title = {A sparse-sparse iteration for computing a sparse incomplete},
journal = {Applied Mathematics and Computation},
year = {2009},
number = {59},
month = {March},
issn = {0096-3003},
pages = {1265--1283},
numpages = {18},
keywords = {Keywords: Sparse matrices; Factorized sparse approximate inverse; Preconditioning; Krylov subspace methods; Symmetric positive definite;
Preconditioned CG algorithm},
}
%0 Journal Article
%T A sparse-sparse iteration for computing a sparse incomplete
%A داوود خجسته سالکویه
%A Toutounian Mashhad, Faezeh
%J Applied Mathematics and Computation
%@ 0096-3003
%D 2009
