The Improved Bareiss Algorithm of Solving Linear Equations Symbolically
Xiao-Shan Gao
Abstract
Xiao-Shan Gao
Abstract
Comparing with the Gauss method for solving linear equations, the Bareiss elimination method can be used to avoid the phenomenon of coefficient explosion in the computation process. Using the improved Bareiss elimination method, we can solve linear equations whose coefficient matrix is singular or the coefficient matrix is not square. Based on this improvement and the syzygy algorithm, we give an algorithm to find polynomial solutions to a system of linear equations with polynomial coefficients. We implement the algorithms in the software MMP (Mathematics Mechanization Platform) developed by ourselves.
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.
Comparing with the Gauss method for solving linear equations, the Bareiss elimination method can be used to avoid the phenomenon of coefficient explosion in the computation process. Using the improved Bareiss elimination method, we can solve linear equations whose coefficient matrix is singular or the coefficient matrix is not square. Based on this improvement and the syzygy algorithm, we give an algorithm to find polynomial solutions to a system of linear equations with polynomial coefficients. We implement the algorithms in the software MMP (Mathematics Mechanization Platform) developed by ourselves.
Key concepts: Coefficient matrix, Gaussian elimination, System of linear equations, Computation, Mathematics, Applied mathematics, Matrix (chemical analysis), Linear equation