The parallel QZ decomposition method for solving linear equations

Abstract

The QR orthogonal decomposition method is well established for solving linear systems and both sequential and parallel implementations have been proposed. In this paper, the QZ orthogonal decomposition method is proposed in which 2 elements are eliminated simultaneously. Consequently, the theoretical analyses presented show that the QZ method is faster than the QR method which is confirmed by the numerical results.

Keywords:

• QR and QZ orthogonal decomposition
• computational complexity
• shared memory access count
• annihilation pattern
• greedy algorithm

C.R. Categories:

• G 1.3
• F 2.1