The Use of Solvable Directed Graphs in a Jacobi-like Algorithm
European Journal of Mathematics and Statistics · 2021
DOI: 10.24018/ejmath.2021.2.3.39 ↗Kurz gefasst
Fachartikel in der Zeitschrift European Journal of Mathematics and Statistics, 2021. Verfasst von Meltem Turan. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Turan, M. (2021). The Use of Solvable Directed Graphs in a Jacobi-like Algorithm. European Journal of Mathematics and Statistics. https://doi.org/10.24018/ejmath.2021.2.3.39
Vancouver
Turan M. The Use of Solvable Directed Graphs in a Jacobi-like Algorithm. European Journal of Mathematics and Statistics. 2021. doi:10.24018/ejmath.2021.2.3.39
BibTeX
@article{Turan2021,
author = {Turan, Meltem},
title = {The Use of Solvable Directed Graphs in a Jacobi-like Algorithm},
journal = {European Journal of Mathematics and Statistics},
year = {2021},
doi = {10.24018/ejmath.2021.2.3.39}
}
EUVIMED