The Use of Solvable Directed Graphs in a Jacobi-like Algorithm
Meltem Turan · European Journal of Mathematics and Statistics · 2021
In this paper, we introduce a Jacobi-like algorithm (we call D-NJLA) to reduce a real nonsymmetric n × n matrix to a real upper triangular form by the help of solvable directed graphs. This method uses only real arithmetic and a sequence of orthogonal similarity transformations and achieves ultimate quadratic convergence. A theoretical analysis is constructed and some experimental results are given.