Abstract
AbstractPreconditioning techniques based on ILU decomposition, on Frobenius norm minimization and on factorized sparse approximate inverse are considered. These algorithms are applied with conjugate gradient‐type methods, namely Bi‐CGSTAB, QMR and TFQMR for the solution of complex, large, sparse linear systems. The results of numerical experiments in scalar environment with matrices arising from transport in porous media, quantum chemistry, structural dynamics and electromagnetism are analysed. The preconditioner that appears most significant in parallel environment (based on factorized sparse approximate inverse) is then employed on a Cray T3E supercomputer. The experimental results show the satisfactory parallel performance of the proposed algorithm. Copyright © 2003 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
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 callMore From: Communications in Numerical Methods in Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
