Charles A Micchelli
Journal of Approximation Theory
An important recent development in the area of solution of general sparse systems of linear equations has been the introduction of new algorithms that allow complete decoupling of symbolic and numerical phases of sparse Gaussian elimination with partial pivoting. This enables efficient solution of a series of sparse systems with the same nonzero pattern but different coefficient values, which is a fairly common situation in practical applications. This paper reports on a shared- and distributed-memory parallel general sparse solver based on these new symbolic and unsymmetric-pattern multifrontal algorithms. © 2007 Springer-Verlag.
Charles A Micchelli
Journal of Approximation Theory
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence