2004Systems Engineering - Theory & PracticeRequires access

The Improved Bareiss Algorithm of Solving Linear Equations Symbolically

Xiao-Shan Gao

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Coefficient matrix, Gaussian elimination, System of linear equations, Computation, Mathematics, Applied mathematics, Matrix (chemical analysis), Linear equation

Related papers

Back to paper searchBrowse research topicsOriginal source
The Improved Bareiss Algorithm of Solving Linear Equations Symbolically — Research Paper | ScholarLens