论文部分内容阅读
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 (