The current paper is mainly devoted to construct a generalized symbolic Thomas algorithm that will never fail. Two new efficient and reliable computational algorithms are given. The algorithms are suited for implement...The current paper is mainly devoted to construct a generalized symbolic Thomas algorithm that will never fail. Two new efficient and reliable computational algorithms are given. The algorithms are suited for implementation using computer algebra systems (CAS) such as Mathematica, Macsyma and Maple. Some illustrative examples are given.展开更多
The current paper is mainly devoted for solving centrosymmetric linear systems of equations. Formulae for the determinants of tridiagonal centrosymmetric matrices are obtained explicitly. Two efficient computational a...The current paper is mainly devoted for solving centrosymmetric linear systems of equations. Formulae for the determinants of tridiagonal centrosymmetric matrices are obtained explicitly. Two efficient computational algorithms are established for solving general centrosymmetric linear systems. Based on these algorithms, a MAPLE procedure is written. Some illustrative examples are given.展开更多
文摘The current paper is mainly devoted to construct a generalized symbolic Thomas algorithm that will never fail. Two new efficient and reliable computational algorithms are given. The algorithms are suited for implementation using computer algebra systems (CAS) such as Mathematica, Macsyma and Maple. Some illustrative examples are given.
文摘The current paper is mainly devoted for solving centrosymmetric linear systems of equations. Formulae for the determinants of tridiagonal centrosymmetric matrices are obtained explicitly. Two efficient computational algorithms are established for solving general centrosymmetric linear systems. Based on these algorithms, a MAPLE procedure is written. Some illustrative examples are given.
