Topological Structure and Parallel-Triangulation Solutions of Transient Problems by Forward Eulers Method Forward Euler 방법에 의한 과도문제의 위상적 구조와 병렬삼각분할의 해

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.
Publisher
한국정보과학회
Issue Date
1989-03
Language
KOR
Citation

JOURNAL OF KISS, v.16, no.2, pp.190 - 198

metadata.dc.identifier.alternativecitation
정보과학회논문지 제16권 제2호, pp.190-198
ISSN
0258-9125
URI
http://hdl.handle.net/10203/8359
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
DOMJ6.pdf(575.12 kB)Download
  • Hit : 231
  • Download : 118
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0