Skip to main content
SpringerLink
Log in

ILUTP_Mem: A Space-Efficient Incomplete LU Preconditioner

  • Conference paper
Computational Science and Its Applications – ICCSA 2004 (ICCSA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3046))

Included in the following conference series:

Abstract

When direct methods for solving large, sparse, nonsymmetric systems of linear equations use too much computer memory, users often turn to preconditioned iterative methods. It can be critical in solving such systems to choose a preconditioner which both uses a limited amount of memory, and helps the subsequently applied iterative solver converge more rapidly. This paper describes ILUTP_Mem, an incomplete LU preconditioner that computes an incomplete LU factorization that effectively uses an amount of space specified by the user. The ILUTP_Mem preconditioner is evaluated on a set of matrices from real applications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Axelsson, O., Munksgaard, N.: Analysis of incomplete factorizations with fixed storage allocation. In: Evans, D. (ed.) Preconditioning Methods Theory and Applications, pp. 219–241. Gordon and Breach (1983)

    Google Scholar 

  2. Benzi, M., Haws, J.C., Tuma, M.: Preconditioning highly indefinite and nonsymmetric matrices. SIAM J. Sci. Comput. 22(4), 1333–1353 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, T.-Y.: Preconditioning sparse matrices for computing eigenvalues and solving linear systems of equations. PhD thesis, University of California at Berkeley (December 2001)

    Google Scholar 

  4. Chow, E., Saad, Y.: Experimental study of ILU preconditioners for indefinite matrices. J. Comp. and Appl. Math. 86, 387–414 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Davis, T.: University of Florida sparse matrix collection. NA Digest 92(42) (October 16, 1994) and NA Digest 96(28) (July 23, 1996) and NA Digest 97(23) (June 7, 1997), available at: http://www.cise.ufl.edu/~davis/sparse/

  6. Davis, T.A., Gilbert, J.R., Larimore, S.I., Ng, E.G.: A column approximate minimum degree ordering algorithm. Technical Report TR-00-005, Department of Computer and Information Science and Engineering, University of Florida (October 2000)

    Google Scholar 

  7. Duff, S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl. 20(4), 889–901 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Duff, S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl. 22(4), 973–996 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Eijkhout, V.: Overview of iterative linear system solver packages. Lapack working note 141 (July 1998)

    Google Scholar 

  10. Gilbert, J.R., Toledo, S.: An assessment of incomplete-LU preconditioners for nonsymmetric linear systems. Informatica 24, 409–425 (2000)

    MATH  Google Scholar 

  11. Jones, M.T., Plassmann, P.E.: An improved incomplete Cholesky factorization. ACM Trans. on Math. Softw. 21(1), 5–17 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lin, C.-J., Moré, J.J.: Incomplete Cholesky factorizations with limited memory. Technical Report MCS-P682-0897, Argonne National Laboratory (August 1997)

    Google Scholar 

  13. UC Berkeley Millennium Project, http://www.millennium.berkeley.edu/

  14. Munksgaard, N.: Solving sparse symmetric sets of linear equations by preconditioned conjugate gradients. ACM Trans. on Math. Softw. 6, 206–219 (1980)

    Article  MATH  Google Scholar 

  15. Saad, Y.: ILUT: A dual threshold incomplete LU factorization. Numer. Linear Algebra Appl. 4, 387–402 (1994)

    Article  MathSciNet  Google Scholar 

  16. Saad, Y.: Iterative methods for sparse linear systems. PWS publishing company (1996)

    Google Scholar 

  17. Saad, Y., Schultz, M.H.: GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7(3), 856–869 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  18. Saad, Y., van der Vorst, H.A.: Iterative solution of linear systems in the 20th century. J. of Comp. and Appl. Math. 123, 1–33 (2000)

    Article  MATH  Google Scholar 

  19. Suarjana, M., Law, K.H.: A robust incomplete factorization based on value and space constraints. Int. J. Numer. Meth. Engng. 38, 1703–1719 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Pomona College, Claremont, CA, 91711, USA

    Tzu-Yi Chen

Authors
  1. Tzu-Yi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  5. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  6. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, TY. (2004). ILUTP_Mem: A Space-Efficient Incomplete LU Preconditioner. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24768-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24768-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22060-2

  • Online ISBN: 978-3-540-24768-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation