Presentation 1999/9/22
Parallel Processing of Finding All Solutions by Interval Computations
Takashi HISAKADO, Kohshi OKUMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The krawczyk, Moore and Jones algorithm is effective for finding all solutions of nonlinear circuit equations. This method, however, requires impractical computation time for large equation. This paper presents an approach for finding all solutions by parallelizing the algorithm. To achieve efficient parallel computation performance on message passing in a distributed-memory systems, a method of low communication and coarse grain parallelization is supposed. Additionally, we confirm the effectiveness of the implementation with a parallel computer.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Filding all solutions / Interval computation / Parallel processing / Circuit equation
Paper # NLP99-100
Date of Issue

Conference Information
Committee NLP
Conference Date 1999/9/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Parallel Processing of Finding All Solutions by Interval Computations
Sub Title (in English)
Keyword(1) Filding all solutions
Keyword(2) Interval computation
Keyword(3) Parallel processing
Keyword(4) Circuit equation
1st Author's Name Takashi HISAKADO
1st Author's Affiliation Department of Electrical Engineering, Kyoto University()
2nd Author's Name Kohshi OKUMURA
2nd Author's Affiliation Department of Electrical Engineering, Kyoto University
Date 1999/9/22
Paper # NLP99-100
Volume (vol) vol.99
Number (no) 324
Page pp.pp.-
#Pages 6
Date of Issue