Abstract
In this paper parallel algorithms for solving the continuous-time algebraic Riccati equation both on shared memory multiprocessors and distributed memory multiprocessors are presented. The algorithms are based on the matrix Sign function of the Hamiltonian matrix associated with the equation. In the case of shared memory multiprocessors, the use of LAPACK and BLAS-3 subroutines allows the generation of reliable, portable and efficient subroutines for solving the algebraic Riccati equation. In the case of distributed memory multiprocessors, the distribution of the data wrapped by blocks of columns among the processors and the use of LAPACK and BLAS-3 subroutines improves the efficiency of the algorithms as reported in the experimental results.
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.
