Abstract

AbstractThis paper describes a parallel implementation of LDLT factorization on a distributed‐memory parallel computer. Specifically, the parallel LDLT factorization procedure is based on a row‐oriented sparse storage scheme. In addition, a strategy is proposed for the parallel solution of a triangular system of equations. The strategy is to compute the inverses of the dense principal diagonal block submatrices of the factor L, stored in a row‐oriented structure. Experimental results for a number of finite element models are presented to illustrate the effectiveness of the parallel solution schemes.

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

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.