An optimized computer implementation of incomplete Cholesky factorization

Bitoulas, N; Papadrakakis, M

dc.contributor.author	Bitoulas, N	en
dc.contributor.author	Papadrakakis, M	en
dc.date.accessioned	2014-03-01T01:09:43Z
dc.date.available	2014-03-01T01:09:43Z
dc.date.issued	1994	en
dc.identifier.issn	0956-0521	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11156
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0028443887&partnerID=40&md5=5e7c6b1f66adffc2841f1e0a86dbdfff	en
dc.subject.classification	Computer Science, Interdisciplinary Applications	en
dc.subject.classification	Engineering, Multidisciplinary	en
dc.subject.other	Approximation theory	en
dc.subject.other	Convergence of numerical methods	en
dc.subject.other	Data storage equipment	en
dc.subject.other	Iterative methods	en
dc.subject.other	Mathematical transformations	en
dc.subject.other	Matrix algebra	en
dc.subject.other	Optimization	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Response time (computer systems)	en
dc.subject.other	Vectors	en
dc.subject.other	Incomplete Cholesky factorization	en
dc.subject.other	Preconditioning techniques	en
dc.subject.other	Computational methods	en
dc.title	An optimized computer implementation of incomplete Cholesky factorization	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1994	en
heal.abstract	Preconditioning techniques based on incomplete Cholesky factorization are very efficient in increasing the convergence rates of basic iterative methods. Complicated addressings and high demands for auxiliary storage, or increased factorization time, have reduced their appeal as general purpose preconditioners. In this study an elegant computational implementation is presented which succeeds in reducing both computing storage and factorization time. The proposed implementation is applied to two incomplete factorization schemes. The first is based on the rejection of certain terms according to their magnitude, while the second is based on a rejection criterion relative to the position of the zero terms of the coefficient matrix. Numerical results demonstrate the superiority of the proposed preconditioners over other types of preconditioning matrices, particularly for ill-conditioned problems. They also show their efficiency for large-scale problems in terms of computer storage and CPU time, over a direct solution method using the skyline storage scheme. © 1994.	en
heal.publisher	PERGAMON-ELSEVIER SCIENCE LTD	en
heal.journalName	Computing Systems in Engineering	en
dc.identifier.isi	ISI:A1994PJ75600005	en
dc.identifier.volume	5	en
dc.identifier.issue	3	en
dc.identifier.spage	265	en
dc.identifier.epage	274	en