Journal ArticleOPEN ACCESS

A Generalized Symbolic Thomas Algorithm

  • El-Mikkawy M
Applied Mathematics (2012) 03(04) 342-345
DOI: 10.4236/am.2012.34052
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

El-Mikkawy, M. (2012). A Generalized Symbolic Thomas Algorithm. Applied Mathematics, 03(04), 342–345. https://doi.org/10.4236/am.2012.34052

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free