Improving the efficiency of incomplete Choleski preconditionings

Papadrakakis, Manolis; Dracopoulos Michael, C

dc.contributor.author	Papadrakakis, Manolis	en
dc.contributor.author	Dracopoulos Michael, C	en
dc.date.accessioned	2014-03-01T01:08:24Z
dc.date.available	2014-03-01T01:08:24Z
dc.date.issued	1991	en
dc.identifier.issn	0748-8025	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10460
dc.subject.classification	Engineering, Multidisciplinary	en
dc.subject.classification	Mathematics, Applied	en
dc.subject.other	Mathematical Techniques--Finite Element Method	en
dc.subject.other	Mathematical Techniques--Iterative Methods	en
dc.subject.other	Choleski Factorization	en
dc.subject.other	Preconditioning	en
dc.subject.other	Structural Analysis	en
dc.title	Improving the efficiency of incomplete Choleski preconditionings	en
heal.type	journalArticle	en
heal.identifier.primary	10.1002/cnm.1630070806	en
heal.identifier.secondary	http://dx.doi.org/10.1002/cnm.1630070806	en
heal.language	English	en
heal.publicationDate	1991	en
heal.abstract	Techniques based on the idea of preconditioning have significantly improved the efficiency of classical iterative methods. In this work two preconditioning approaches based on incomplete Choleski factorization have been further refined, with the result that both storage requirements and solution times have been greatly improved. The first is based on the rejection of certain terms of the factorization process according to their magnitude. An efficient computational handling of the incomplete factorization is proposed which improves substantially the complicated addressings and the overall efficiency of the iterative method. The second preconditioning matrix is based on a rejection criterion relative to the position of the non-zero terms of the coefficient matrix. Such preconditioners have been proposed in the past but experience with the application of the finite-element method is not favourable since the factorization very often becomes unstable or the rate of convergence is not satisfactory. The modifications proposed here give this type of incomplete factorization both robustness and efficiency.	en
heal.publisher	JOHN WILEY & SONS LTD	en
heal.journalName	Communications in Applied Numerical Methods	en
dc.identifier.doi	10.1002/cnm.1630070806	en
dc.identifier.isi	ISI:A1991GQ98400005	en
dc.identifier.volume	7	en
dc.identifier.issue	8	en
dc.identifier.spage	603	en
dc.identifier.epage	612	en