Improving the efficiency of preconditioning for iterative methods

Papadrakakis, M; Dracopoulos, MC

dc.contributor.author	Papadrakakis, M	en
dc.contributor.author	Dracopoulos, MC	en
dc.date.accessioned	2014-03-01T02:47:53Z
dc.date.available	2014-03-01T02:47:53Z
dc.date.issued	1989	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33407
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0024872363&partnerID=40&md5=8c87dd37aea5bae803b80fe05befa404	en
dc.subject.other	Structural Analysis--Computer Aided Analysis	en
dc.subject.other	Global Preconditioners	en
dc.subject.other	Incomplete Choleski Factorization	en
dc.subject.other	Partial Preconditioning	en
dc.subject.other	Preconditioning	en
dc.subject.other	Mathematical Techniques	en
dc.title	Improving the efficiency of preconditioning for iterative methods	en
heal.type	conferenceItem	en
heal.publicationDate	1989	en
heal.abstract	Techniques based on the idea of preconditioning and on the element-by-element concept have significantly improved the efficiency of classical iterative methods in conventional as well as in parallel hardware environment. In this work two preconditioning approaches based on the incomplete Choleski factorization have been further refined, with the result that both storage requirements and solution times have been greatly improved when processing large structural problems. The partial preconditioning method is also employed to develop a framework for constructing a global preconditioner, without the need to store the complete coefficient matrix, for accelerating an iterative element-by-element solution procedure.	en
heal.publisher	Publ by Civil-Comp Limited, Edinburgh, United Kingdom	en
heal.journalName	[No source information available]	en
dc.identifier.spage	297	en
dc.identifier.epage	306	en