ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices

Journal: Discrete and Continuous Models and Applied Computational Science (Vol.33, No. 1)

Publication Date:

Authors : ;

Page : 46-56

Keywords : numerical analysis; computational methods for sparse matrices; numerical mathematical programming methods; complexity of numerical algorithms;

Source : Download Find it from : Google Scholarexternal

Abstract

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.

Last modified: 2025-08-08 18:12:26