The Use of Solvable Directed Graphs in a Jacobi-like Algorithm
Makaleler > Tam Makale · 2021
Yazarlar: Meltem Turan
European Journal of Mathematics and Statistics, Uluslararası, 2021, cilt 2, ss 43-51
DOI: 10.24018/ejmath.2021.2.3.39
Özet
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.