A block-recursive approach to unitary matrix decomposition

• Datum: 2026
• Hauptverfasser: Malaschonok, G.I., Sukharskyi, S.S.
• Format: Artikel
• Sprache: Ukrainisch
• Veröffentlicht: PROBLEMS IN PROGRAMMING 2026
• Schlagworte: unitary matrix decomposition; block-recursive algorithm; parallel computing; graphics processing unit; UDC 519.61:004.272
• Online Zugang: https://pp.isofts.kiev.ua/index.php/ojs1/article/view/895
• Назва журналу: Problems in programming

Singular value decomposition is one of the fundamental tools of numerical linear algebra and is widely used in data processing, optimization, computer vision, and machine learning. The classical approach to its computation is based on the Householder algorithm, which reduces an arbitrary matrix to a tridiagonal or bidiagonal form followed by the computation of singular values. However, as the matrix size increases, significant difficulties arise in efficiently parallelizing such algorithms, which limits their performance on modern high-performance computing systems. One promising approach to overcoming these limitations is the use of block-recursive algorithms. Such algo rithms allow the original problem to be decomposed into independent block subproblems that can be processed in parallel, providing a high degree of scalability on multiprocessor systems and distributed-memory clusters. This paper proposes a new block-recursive algorithm for the orthogonal (or unitary) decomposition of symmetric matrices based on QR and QP decompositions. The algorithm constructs orthogonal (unitary) factors and pro duces a band matrix, reducing the computational complexity of subsequent stages of spectral decomposition. A complexity analysis is presented showing that the asymptotic order of the algorithm is determined by the complexity of matrix multiplication.Experimental performance studies were carried out in a parallel computing environment using GPU acceleration for matrix operations. The obtained results demonstrate the efficiency of the proposed algorithm as the problem size increases and confirm the agreement between the experimental com plexity and the theoretical estimates. The reconstruction error of the matrix remains at the level of machine precision for double-precision floating-point numbers, which indicates the numerical stability of the proposed approach.Problems in programming 2026; 1: 102-111