Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices

Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as problems of the computational linear algebra where finding the solution of such a system of linear algebraic equations is considered to be one...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete and continuous models and applied computational science Ročník 33; číslo 1; s. 46 - 56
Hlavní autor:	Milena, Veneva
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Peoples’ Friendship University of Russia (RUDN University) 15.06.2025
Témata:	complexity of numerical algorithms computational methods for sparse matrices numerical analysis numerical mathematical programming methods
ISSN:	2658-4670, 2658-7149
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as problems of the computational linear algebra where finding the solution of such a system of linear algebraic equations is considered to be one of the most important problems. This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of the algorithm is formulated and proven. Formula for the complexity of the multidiagonal numerical algorithm is obtained.
ISSN:	2658-4670 2658-7149
DOI:	10.22363/2658-4670-2025-33-1-46-56