skip to main content
10.1145/125826.126135acmconferencesArticle/Chapter ViewAbstractPublication PagesscConference Proceedingsconference-collections
Article
Free access

PILS: an iterative linear solver package for ill-conditioned systems

Published: 01 August 1991 Publication History
First page of PDF

References

[1]
A. V. Aho, J. E. Hopcroft, and 3. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts, 1983.
[2]
B. J. Baliga. Evolution of MOS-bipolar power semiconductor technology. Proc. IEEE, 76:409-418, 1988.
[3]
R. E. Bank, W. M. Coughran, Jr., M. A. Driscoll, R. K. Smith, and W. Fichtner. Iterative methods in semiconductor device simulation. Uompttter Physics Communications, 53:201-212, 1989.
[4]
R. E. Bank, W. M. Coughran, Jr., W. Eichtner, E. H. Grosse, D. d. Rose, and R. K. Smith. Transient simulation of silicon devices and circuits. IEEE Transactzons on Computer-Aided Desi9n of lnte9rated Czrcuzts, CAD-4:436-451, June 1985.
[5]
R. E. Bank and R. K. Smith. General sparse elimination requires no permanent integer storage. SlAM J. Scz. Stat. Gomput., 8(4):574-584, July 1987.
[6]
R. Bramley and A. Sameh. Row projection methods for large nonsymmetric linear systems. CSRD Rpt. 957, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, January 1990.
[7]
J. F. Bfirgler. Discretizat~on and Grzd Adaptation, zn Semiconductor Device Modehn9. PhD thesis, ETH- Ziirich, 1990. publ. by Hartung-Gorre Verlag, Konstanz, Germany.
[8]
P. Conti. Grid Generation for Three-dimensional Semiconductor Device Simulation. PhD thesis, ETH- Ziirich, 1991. publ. by Hartung-Gorre Verlag, Konstanz, Germany.
[9]
S. C. Eisenstat, M. C. Gursky, M. H. Schultz, and A. H. Sherman. Yale sparse matrix package i: The symmetric codes. 1at. J. Numer. Meth. Eng., 18:1145-1151, 1982.
[10]
S. C. Eisenstat. Efficient implementation of a class of preconditioned conjugate gradient methods. SIAM J. Sc~. Stat. Comput., 2(1):1-4, March 1981.
[11]
W. Fichtner, L. W. Nagel, B. R. Penumalli, W. P. Petersen, and J. L. D'Arcy. The impact of supercomputers on IC technology development and design. Proc. 1EEE, 72(1):96-112, January 1984.
[12]
R. Fletcher. Conjugate gradient methods for indefinite systems. In G. A. Watson, editor, Proc. of the Dundee Biennal Conference on Numerical Analyszs, New York, 1975. Springer-Verlag.
[13]
C. W. Gear. Numemcal lnitzal Value Problems. Prentice-Hall, 1971.
[14]
A. George and J. W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-I{a.ll, Englewood Cliffs, New Jersey 07632, 1981.
[15]
M. H. Gutknecht. A completed theory of the unsymmetric Lanczos process and related algorithms Part I. IPS Research Report 90-10, Interdisciplinary Project Center for Supercomputing, ETH Ziirich, June 1990. submitted to SIAM J. Matrix Anal. Appl.
[16]
M. H. Gutknecht. A completed theory of tire un- ~ymmetric L~nczo~ proce~ ~nd related ~lgorithm~ Part II. IPS Research Report 90-16, Interdisciplinary Project Center for Supercompllting, ETH Ziirich, September 1990. submitted to SIAM J. Matrix Anal. Appl.
[17]
G. Heiser, C. Pommerell, J. Weis, and W. Fichtner. Three dimensional numerical semiconductor device simulation: Algorithms, architectures, results. IEEE Transactions on Computer-Aided Design o} Integrated Circuits, 10(9), September 1991.
[18]
M. R. Hestenes and E. Stiefel. Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand., 49:409-436, 1952.
[19]
J. A. Meijerink and H. A. van der Vorst. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. of Comput., pages 148-162, 1977.
[20]
C. Pommerell, M. Annaratone, and W. Fichtner. A set of new mapping and coloring heuristics for distributed-memory parallel processors. SIAM J. Sci. Star. Comput., t3, January 1992.
[21]
P. J. Roache. Computational Fluzd Dynamics. Hermosa Publishers, Albuquerque, 1982.
[22]
Y. Sand. Krytov subspace methods on supercomputers. SIAM J. Sci. Stat. Comput., 10(6):1200-1232, November 1989.
[23]
Y. Sand. Sparskit: a basic tool kit for sparse matrix computations. Technical Report 90.20, RIACS, NASA Ames Research Center, May 1990.
[24]
Y. Sand and M. H. Schultz. GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput., 7(3):856- 869, July 1986.
[25]
G. D. Smith. Numemcal Solution of Partial Differential Equations: Finite Difference Methods. Oxford University Press, 1978.
[26]
P. Sonneveld. CGS, a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Stat. Cornput., 10(1):36-52, January 1989.
[27]
G. Strang and G. J. Fix. An Analysis of the Finite Element Method. Prentice-Hall, 1973.
[28]
H. A. van der Vorst. Bi-CGSTAB: A fast and smoothly converging variant of CG-S for the solution of nonsymmetric linear systems, submitted to SIAM J. Sci. Star. Comput.
[29]
H. A. van der Vorst. The convergence behavior of some it.erative solution methods. Report 89-19, Faculty of Technical Mathematics and Informatics, Delft University of Technology, 1989. ISSN 0922-5641.
[30]
P. K. W. Vinsome. ORTHOMIN - an iterative method for solving sparse sets of simultaneous linear equations, in Proc. Fourth SPE Symposium on Reservoir Simulation, pages 149-160, Los Angeles, February 197"6. Society of Petroleum Engineers. Paper $PE 5739.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing
August 1991
920 pages
ISBN:0897914597
DOI:10.1145/125826
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1991

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SC '91
Sponsor:

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;
Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)53
  • Downloads (Last 6 weeks)8
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media