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: 2025-08-08
Authors : Veneva Milena;
Page : 46-56
Keywords : numerical analysis; computational methods for sparse matrices; numerical mathematical programming methods; complexity of numerical algorithms;
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.
Other Latest Articles
- Statistical and density-based clustering techniques in the context of anomaly detection in network systems: A comparative analysis
- Modeling and optimization of an M/M/1/K queue with single working vacation, feedback, and impatience timers under N-policy
- Abstract structure
- The Impact of Inflation Adjustment on The Financial Performance of Companies: A Study of The Retail and Wholesale Sectors
- Childhood at the Margins: Structures of Power, Violence, and Social Memory in Babel’s The Story of My Dovecote
Last modified: 2025-08-08 18:12:26