Abstract: The algorithm of multiple relatively robust representations(MRRR) is one of the fastest and most accurate algorithms. After analyzing the MRRR algorithm and CUDA parallel architecture, parallel MRRR algorithm based on CUDA was given, and explored the optimization in memory structure. Compared with LAPACK's MRRR implementa- lion this parallel method provides 20-fold speedups. This result demonstrates the algorithm can be mapped efficiently onto GPU.

Key words: MRRR, Parallel, CUDA, Eigenproblem