Symbolic methods for the element preconditioning technique

Authors:
Ulrich Langer;Stefan Reitzinger;Josef Schicho
Affiliations:
Institute of Computational Mathematics, University of Linz, Austria;Institute of Computational Mathematics, University of Linz, Austria;Research Institute of Symbolic Computation, University of Linz, Austria
Venue:
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Year:
2001

Citing 4
Cited 2

Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation
Polynomial Algorithms in Computer Algebra

Polynomial Algorithms in Computer Algebra
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Improvements in cad-based quantifier elimination

Improvements in cad-based quantifier elimination

On the utilization of edge matrices in algebraic multigrid

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
A local Fourier convergence analysis of a multigrid method using symbolic computation

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.