Topological Structure and Parallel-Triangulation Solutions of Transient Problems by Forward Eulers Method

Abstract

The object of this paper is to compare the parallel solution of differential equations between a topological structure of a matrix A after single odd/even permutation and the operations of its triangulation graph. Two kind of problems are discussed. One is to find the minimum(the least) number of parallel processors according to the number of discrete time steps of T. Simultaneously, the second is from a given sparse matrix to determine the minimum(the least) number of required steps in the entire solution process Conclusions show that the proper number of microprocessors chosen between two methods depends on the given situation.