Referenced Items are not available for this document.
Based on a CGS (conjugate gradient squared) iteration with a partitioned natural ordering, a novel massively parallel algorithm for three-dimensional device simulation is presented. This algorithm requires constant time per matrix iteration independent of the number of grid nodes, and has convergence properties comparable to those of good algorithms currently used on sequential computers. This algorithm has been implemented on the Connection Machine and achieves supercomputer performance for large numbers of grid nodes. Results are presented for a wide variety of devices and mesh sizes
Published in:
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
(Volume:10
,
Issue:
9
)
Date of Publication: Sep 1991
- Page(s):
- 1201 - 1209
- ISSN :
- 0278-0070
- INSPEC Accession Number:
- 4025295
- Digital Object Identifier :
- 10.1109/43.85767
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sep 1991
- Sponsored by :
- IEEE Council on Electronic Design Automation
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
