Skip to main content

Modified incomplete factorization strategies

Submitted Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 1457)

Abstract

We review here the conditioning properties of modified incomplete symmetric factorizations of Stieltjes matrices, appropriate for the PCG solution of symmetric positive definite linear systems. Emphasizing the algorithmic interpretation of the required assumptions, we analyse the theoretical support that can be given to practical factorization algorithms and the choice left open between “perturbed” and “unperturbed” policies. Recent results extending the scope of unperturbed modified factorizations are included and discussed.

Keywords

  • Positive Vector
  • Dominance Ratio
  • Diagonal Dominance
  • Algorithmic Interpretation
  • Incomplete Factorization

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Axelsson, On iterative solution of elliptic difference equations on a mesh-connected array of processors, Intern. Journal of High Speed Computing, 1 (1989), pp. 165–184.

    CrossRef  MATH  Google Scholar 

  2. O. Axelsson and V. Barker, Finite Element Solution of Boundary Value Problems. Theory and Computation, Academic, New York, 1984.

    MATH  Google Scholar 

  3. O. Axelsson and V. Eijkhout, Rebust vectorizable preconditioners for three-dimensional elliptic difference equations with anisotropy, in Algorithms and Applications on Vector and Parallel Computers, H. te Riele, T. J. Dekker, and H. van der Vorst, eds., Elsevier (North Holland), Amsterdam, 1987, pp. 279–306.

    Google Scholar 

  4. O. Axelsson and I. Gustafsson, Preconditioning and two-level multigrid methods of arbitrary degree of approximation, Math. Comp., 40 (1983), pp. 214–242.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. R. Beauwens, Upper eigenvalue bounds for pencils of matrices, Linear Algebra Appl., 62 (1984), pp. 87–104.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. —, On Axelsson's perturbations, Linear Algebra Appl., 68 (1985), pp. 221–242.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. —, Consistent ordering analysis, Scientific Report, Université Libre de Bruxelles, Brussels, 1986.

    Google Scholar 

  8. —, Lower eigenvalue bounds for pencils of matrices, Linear Algebra Appl., 85 (1987), pp. 101–119.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. —, Approximate factorizations with S/P consistently ordered M-factors, BIT, 29 (1989), pp. 658–681.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. R. Beauwens and R. Wilmet, Conditioning analysis of positive definite matrices by approximate factorizations, J. Comput. Appl. Math., 26 (1989), pp. 257–269.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. A. George and J. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, 1981.

    MATH  Google Scholar 

  12. I. Gustafsson, On first order factorization methods for the solution of problems with mixed boundary conditions and problems with discontinuous material coefficients, Research Report 77.13R, Dept. of Computer Sciences, Chalmers Univ. of Technology and Univ. of Goeteborg, Goeteborg, Sweden, 1977.

    Google Scholar 

  13. —, Modified incomplete Cholesky (MIC) methods, in Preconditioning Methods. Theory and Applications, D. Evans, ed., Gordon and Breach, New York-London-Paris, 1983, pp. 265–293.

    Google Scholar 

  14. F. Harary, Graph Theory, Addison-Wesley, Reading, 1969.

    MATH  Google Scholar 

  15. Y. Notay, Incomplete factorization of singular linear systems, BIT, 29 (1989), pp. 682–702.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. —, Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations, BIT, (1990). submitted.

    Google Scholar 

  17. —, Solving positive (semi)definite linear systems by preconditioned iterative methods, these Proceedings, (1990).

    Google Scholar 

  18. R. Varga, On recurring theorems on diagonal dominance, Linear Algebra Appl., 13 (1976), pp. 1–9.

    CrossRef  MathSciNet  MATH  Google Scholar 

  19. D. Young, Iterative methods for solving partial differential equations of elliptic type, Trans. Amer. Math. Soc., 76 (1954), pp. 91–111.

    CrossRef  Google Scholar 

  20. —, Iterative solution of large linear systems, Academic, New York, 1971.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Beauwens, R. (1990). Modified incomplete factorization strategies. In: Axelsson, O., Kolotilina, L.Y. (eds) Preconditioned Conjugate Gradient Methods. Lecture Notes in Mathematics, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0090898

Download citation

  • DOI: https://doi.org/10.1007/BFb0090898

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53515-7

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

  • eBook Packages: Springer Book Archive