The Use of Solvable Directed Graphs in a Jacobi-like Algorithm

Meltem Turan
Additional contact information
Meltem Turan: Ege University, Turkey

European Journal of Mathematics and Statistics, 2021, vol. 2, issue 3, 43-51

Abstract: 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.

Keywords: eigenvalues and eigenvectors; Jacobi-like algorithms; transformation methods (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
https://eu-opensci.org/index.php/ejmath/article/view/14039 Abstract page (text/html)
https://eu-opensci.org/index.php/ejmath/article/download/14039/3137 Full text (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:epw:ejmath:v:2:y:2021:i:3:id:14039

DOI: 10.24018/ejmath.2021.2.3.39

Access Statistics for this article

More articles in European Journal of Mathematics and Statistics from European Open Science
Bibliographic data for series maintained by Support Team ().