A Generalized Symbolic Thomas Algorithm - Applied Mathematics

AM > Vol.3 No.4, April 2012

A Generalized Symbolic Thomas Algorithm ()

HTML

Download as PDF (Size: 73KB) PP. 342-345

DOI: 10.4236/am.2012.34052 6,026 Downloads 11,542 Views Citations

Author(s)

Moawwad El-Mikkawy

Affiliation(s)

Mathematics Department, Faculty of Science, Mansoura University, Mansoura, Egypt.

ABSTRACT

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.

KEYWORDS

Tridiagonal Matrices; LU Factorization; Linear Systems; DETGTRI Algorithm; Thomas Algorithm

Share and Cite:

M. El-Mikkawy, "A Generalized Symbolic Thomas Algorithm," Applied Mathematics, Vol. 3 No. 4, 2012, pp. 342-345. doi: 10.4236/am.2012.34052.

Journals Menu