Abstract
We believe that these preliminary results indicate that the amalgamation methods considered here hold promise, especially for large, ill-conditioned problems for which direct methods are inappropriate and simple element-by-element pre-conditioners ineffective. However, we must be cautious as our proposals are merely heuristics, and believe that further experimentation is necessary to assess the full potential of the methods.
The technique can also be applied to other element-by-element preconditioners or to block methods. For example, the assembly of some super-elements would decrease the cost of the solution step for the GS EBE preconditioner (see Hughes et al., 1983, and Ortiz et al., 1983).
Chapter PDF
References
Amestoy, P. R., Daydé, M. J., Duff, I. S., L'Excellent, J.-Y., Gould, N. I. M., Reid, J. K. and Scott, J. A. (1994), MUSSELS — a multifrontal sparse symmetric element-input linear solver. Technical report, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England. Working note.
Daydé, M. J., L'Excellent, J.-Y. and Gould, N. I. M. (1994), On the use of elementby-element preconditioners to solve large scale partially separable optimization problems, Technical Report RT/APO/94/4, ENSEEIHT-IRIT, Toulouse, France. To appear in SIAM Journal on Scientific Computing.
Daydé, M. J., L'Excellent, J.-Y. and Gould, N. I. M. (1995), User's guide to PAREBE: parallel element-by-element preconditioners for the conjugate gradient algorithm, Technical report, ENSEEIHT-IRIT, Toulouse, France. To appear.
Gustafsson, I. and Linskog, G. (1986), ‘A preconditioning technique based on element matrix factorization', Comput. Methods Appl. Mech. Eng. 55, 201–220.
Harwell Subroutine Library (1993), A catalogue of subroutines (release 11), Advanced Computing Department, Harwell Laboratory, Harwell, UK.
Hughes, T. J. R., Levit, I. and Winget, J. (1983), “An element-by-element solution algorithm for problems of structural and solid mechanics', Comput. Methods Appl. Mech. Eng. 36, 241–254.
Karypis, G. and Kumar, V. (1995), METIS: Unstructured graph partitioning and sparse matrix ordering system, version 2.0, Technical report, University of Minnesota, Department of Computer Science, Minneapolis.
L'Excellent, J.-Y. (1995), Utilisation de préconditionneurs élément-par-élément pour la résolution de problèmes d'optimisation de grande taille, PhD thesis, ENSEEIHT-INPT.
Ortiz, M., Pinsky, P. M. and Taylor, R. L. (1983), ‘Unconditionally stable element-byelement algorithms for dynamic problems', Comput. Methods Appl. Mech. Eng. 36, 223–239.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daydé, M.J., L'Excellent, JY., Gould, N.I.M. (1996). Preprocessing of sparse unassembled linear systems for efficient solution using element-by-element preconditioners. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024682
Download citation
DOI: https://doi.org/10.1007/BFb0024682
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61627-6
Online ISBN: 978-3-540-70636-6
eBook Packages: Springer Book Archive