Abstract
The ICCG (incomplete Choleski and conjugate gradient) method has been generalised for solving large-scale systems of linear equations whose coefficient matrices are highly sparse and asymmetric. The generalised method has been successfully tested on matrices with randomly generated elements and is found to be very efficient for two- and three-dimensional device simulations.

This publication has 0 references indexed in Scilit: