Abstract
AbstractFactorization procedures for the efficient solution of large sparse linear finite difference systems have been introduced recently. In these procedures the large sparse symmetric coefficient matrix of a certain structure is factorized exactly, yielding a direct solution method. Furthermore, approximate factorization procedures yeild implicit preconditioning iterative methods for the finite difference solution. The numerical implementation of these algorithms is presented and Fortran subroutines for the efficient solution of the resulting sparse symmetric linear system of algebraic equations are given.
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.
