On the numerical solution of the three-dimensional semiconductor device equations on vector-concurrent computers
DOI10.1016/0010-4655(91)90227-CzbMath0875.65105WikidataQ62600538 ScholiaQ62600538MaRDI QIDQ1366100
K. P. Traar, O. Heinreichsberger, M. Stiftinger, Siegfried Selberherr
Publication date: 10 November 1997
Published in: Computer Physics Communications (Search for Journal in Brave)
semiconductor equationsincomplete factorization preconditionersbiconjugate-gradient algorithmscarrier continuity equationsGummel algorithmsymmetrized conjugate-gradient methodthree-dimensional device simulatorsvector-concurrent supercomputersvery large sparse linear systems of equations
PDEs in connection with optics and electromagnetic theory (35Q60) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Applications to the sciences (65Z05) Geometric optics (78A05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Global approximate Newton methods
- Block Preconditioning for the Conjugate Gradient Method
- High Performance Preconditioning
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- On the Equivalence of Certain Iterative Acceleration Methods
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- How Fast are Nonsymmetric Matrix Iterations?
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- Semiconductor device modelling from the numerical point of view
This page was built for publication: On the numerical solution of the three-dimensional semiconductor device equations on vector-concurrent computers
