A novel block elimination procedure for general linear systems of equations
I.R. Ciric
Abstract
I.R. Ciric
Abstract
Groups of unknowns in linear systems of algebraic equations are eliminated by solving smaller systems whose coefficients are just coefficients in the original systems, with no matrix inversions and multiplications being involved. This could yield solutions with improved accuracy with respect to other solution methods. The amount of computation involved is only slightly higher than that in the Gaussian elimination.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Groups of unknowns in linear systems of algebraic equations are eliminated by solving smaller systems whose coefficients are just coefficients in the original systems, with no matrix inversions and multiplications being involved. This could yield solutions with improved accuracy with respect to other solution methods. The amount of computation involved is only slightly higher than that in the Gaussian elimination.
Key concepts: Gaussian elimination, System of linear equations, Computation, Linear system, Block (permutation group theory), Coefficient matrix, Applied mathematics, Algebraic equation