Abstract
The order of the matrices involved in several algebraic problems decreases during the solution process. In these cases, parallel algorithms which use adaptive solving block sizes offer better performance results than the ones obtained on parallel algorithms using traditional constant block sizes. Recently, new parallel wavefront algorithms solving the Lyapunov equations for the Cholesky factor using Hammarling's method on message passing multiprocessors systems have been designed. In this paper, new parallel adaptive versions of these parallel algorithms are described, and experimental results obtained on an SGI Power Challenge and a SUN UltraSparc cluster are presented. Copyright © 1999 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 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.
