Two classes of algorithms for equation solving are presented and analyzed. These algorithms have been devised in recent years because of the computational facility of the multiprocessor. The first class consists of parallel search methods while the second class consists of asynchronous methods. The
โฆ LIBER โฆ
Parallel methods for solving fundamental file rearrangement problems
โ Scribed by Xiaojun Guan; Michael A. Langston
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 457 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Parallel methods for solving equations
โ
W.L. Miranker
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 730 KB
The Almansi method of fundamental soluti
โ
Andreas Karageorghis; Graeme Fairweather
๐
Article
๐
1988
๐
John Wiley and Sons
๐
English
โ 652 KB
Methods for solving degenerate problems
โ
K.N. Belash; A.A. Tret'yakov
๐
Article
๐
1988
๐
Elsevier Science
โ 415 KB
Problem-solving environments for paralle
โ
David A Padua
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 712 KB
Iterative methods for solving minimax pr
โ
Yu.G. Evtushenko
๐
Article
๐
1974
๐
Elsevier Science
โ 879 KB
Parallelized multilevel characteristic b
โ
Jaime Laviada; Marcos R. Pino; Raj Mittra; Fernando Las-Heras
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 441 KB
## Abstract Parallel implementation of the multilevel characteristic basis function method is discussed in this article. The use of this method enables us to solve very large electromagnetic problems in a direct manner via a recursive application of the characteristic basis function method. Further