The Use of Solvable Directed Graphs in a Jacobi-like Algorithm
2021 ◽
Vol 2
(3)
◽
pp. 43-51
Keyword(s):
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.
1996 ◽
Vol 05
(04)
◽
pp. 653-670
◽
Keyword(s):
2013 ◽
Vol 300-301
◽
pp. 382-388
Keyword(s):
2011 ◽
Vol 2011
◽
pp. 1-6
◽
1997 ◽
Vol 55
(4)
◽
pp. 660-673
◽
2000 ◽
Vol 113
(9)
◽
pp. 3704-3718
◽
Keyword(s):