Symbolic Methods for the Element Preconditioning Technique

  • Ulrich Langer
  • Stefan Reitzinger
  • Josef Schicho
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2630)


The method of element preconditioning requires the construction of an M-matrix which is as close as possible to a given symmetric positive definite matrix in the spectral sense. In this paper we give a symbolic solution of the arising optimization problem for various subclasses. This improves the performance of the resulting algorithm considerably.


Multigrid Method Symbolic Method Sequential Quadratic Programming Algorithm Positive Linear Combination Cylindrical Algebraic Decomposition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    B. Buchberger, An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal, Ph.D. thesis, Universitat Innsbruck, Institut fur Mathematik, 1965, German.Google Scholar
  2. [2]
    —, Gröbner bases: An algorithmic method in polynomial ideal theory, Recent Trends in Multidimensional Systems Theory (N. K. Bose, ed.), D. Riedel Publ. Comp., 1985.Google Scholar
  3. [3]
    G. E. Collins, Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition, Lecture Notes In Computer Science, Springer, 1975, Vol. 33, pp. 134–183.Google Scholar
  4. [4]
    G. E. Collins and H. Hong, Partial cylindrical algebraic decomposition for quantifier elimination, J. Symb. Comp. 12 (1991), No. 3, 299–328.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    G. Haase, U. Langer, S. Reitzinger, and J. Schöberl, Algebraic multigrid methods based on element preconditioning, International Journal of Computer Mathematics 78 (2001), No. 4, 575–598.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    W. Hackbusch, Multigrid methods and application, Springer Verlag, Berlin, Heidelberg, New York, 1985.Google Scholar
  7. [7]
    H. Hong, Improvements in cad-based quantifier elimination, Ph.D. thesis, The Ohio State University, 1990.Google Scholar
  8. [8]
    M. Jung and U. Langer, Applications of multilevel methods to practical problems, Surveys Math. Indust. 1 (1991), 217–257.zbMATHMathSciNetGoogle Scholar
  9. [9]
    M. Jung, U. Langer, A. Meyer, W. Queck, and M. Schneider, Multigrid preconditioners and their application, Proceedings of the 3rd GDR Multigrid Seminar held at Biesenthal, Karl-Weierstraß-Institut für Mathematik, May 1989, pp. 11–52.Google Scholar
  10. [10]
    F. Winkler, Polynomial algorithms in computer algebra, Springer, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Ulrich Langer
    • 1
  • Stefan Reitzinger
    • 1
  • Josef Schicho
    • 2
  1. 1.Institute of Computational MathematicsUniversity of LinzAustria
  2. 2.Research Institute of Symbolic ComputationUniversity of LinzAustria

Personalised recommendations