Symbolic Algorithm for Solving SLAEs with Multi-Diagonal Coefficient Matrices
This is an incremental theoretical contribution for researchers working on specialized linear algebra solvers.
The paper presents a symbolic algorithm for solving linear systems with multi-diagonal matrices, including a correctness theorem and complexity analysis. No concrete numerical results are provided.
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 multi-diagonal numerical algorithm is obtained.