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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call