Abstract
An efficient parallel procedure for the triangulation of real symmetric (or complex Hermitian) matrices is presented. The methods of Gauss and Doolittle have previously been combined to produce a hybrid sequential method that was computationally faster than both. Numerical results demonstrate that this advantage is retained when MIMD (multiple instruction multiple data) distributed memory parallel processing is employed, so that parallel Gauss-Doolittle triangulation is faster than the equivalently parallelized Gauss elimination method.
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 callDisclaimer: 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.
