An efficient algorithm for implementing the finite-element ( ) time-domain FETD method on parallel computers is presented. An unconditionally stable implicit FETD algorithm is combined with the ( ) finite-element tearing and interconnecting FETI method. This domain decomposition algorithm con¨erges
An Efficient Algorithm and Parallel Implementations for Binary and Residue Number Systems
β Scribed by C.N. Zhang; B. Shirazi; D.Y.Y. Yun
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 331 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
Arithmetic units based on a Residue Number System (RNS) are fast and simple, and therefore attractive for use in digital signal processing and symbolic computation applications. However, RNS suffers from overheads of converting numbers to and from residue system. We present a new simple and uniform computation formula for both conversion from RNS to binary and vice versa. Two levels of paralielism for VLSI hardware design of the proposed algorithm are introduced.
π SIMILAR VOLUMES
## Abstract We present the parallel version of a previous serial algorithm for the efficient calculation of canonical MP2 energies (Pulay, P.; Saebo, S.; Wolinski, K. Chem Phys Lett 2001, 344, 543). It is based on the SaeboβAlmlΓΆf directβintegral transformation, coupled with an efficient prescreeni
In this paper an efficient parallel algorithm to solve a three-dimensional problem of subsidence above exploited gas reservoirs is presented. The parallel program is developed on a cluster of workstations. The parallel virtual machine (PVM) system is used to handle communications among networked wor
We extended Mayer's chemical Hamiltonian approach methods to N interacting subsystems at the self-consistent field and density functional levels of theory and discussed an efficient algorithm for the implementation. As an example, Ε½ . Ε½ . the energetics of linear HF chains n varies from 2 to 8 were