Email this article TWO PARTICULAR CASES OF BLOCK-RECURSIVE ALGORITHM LU -DECOMPOSITION OF THE MATRIX OVER IDEMPOTENT SEMIFIELDS
- Authors: Kireev S.A.1
-
Affiliations:
- Tambov State University named after G.R. Derzhavin
- Issue: Vol 21, No 6 (2016)
- Pages: 1998-2004
- Section: Articles
- URL: https://journal-vniispk.ru/2686-9667/article/view/365976
- DOI: https://doi.org/10.20310/1810-0198-2016-21-6-1998-2004
- ID: 365976
Cite item
Full Text
Abstract
We propose two algorithms for particular cases of block-recursive LU -decomposition of matrices over idempotent semifields. We consider the cases in which the band width of the block is equal to 1 or 2. For each of them we will get the decomposition algorithm and give an example.
About the authors
Sergey Anatolevich Kireev
Tambov State University named after G.R. Derzhavin
Email: seregakireeff@yandex.ru
Post-graduate student of the Functional Analysis Department Tambov, the Russian Federation
References
Малашонок Г.И., Киреев С.А. Введение в идемпотентную математику. Тамбов: Издат. дом ТГУ им. Г.Р. Державина, 2014. 48 с. Kireev S. Sequential Algorithm LU-decomposition of matrices over idempotent semifield. International Conference on Mathematical Partnership, Parallel Computing and Computer Algebra: MathParCA-2016, Loutra, Agia Paraskevi, Greece, August, 5 - 15, 2016. P. 41-45. Kireev S. Block-recursive algorithm LU-decomposition of matrices over idempotent semifields // International Conference on Mathematical Partnership, Parallel Computing and Computer Algebra: MathParCA-2016, Loutra, Agia Paraskevi, Greece, August, 5 - 15, 2016. P. 15-16.
Supplementary files
