Abstract
In this paper we describe a parallel library (PLS) to solve linear systems arising from non overlapped Domain Decomposition methods. Preconditioned Krylov subspace iterative methods are considered as linear solvers. PLS had been implemented on the top of PVM using FORTRAN 77, additional library which allows the use of dynamic memory allocation.
Preview
Unable to display preview. Download preview PDF.
References
Axelsson, O.: Iterative Solution Methods. Cambridge University Press (1994).
Cela, J. M., Dürsteier, J. C., Labarta, J.: Manufacturing Progressive Addition Lenses using Distributed Parallel Processing. IRREGULAR96, to be published (1996).
Saad, Y.: ILUT: a dual Threshold Incomplete LU factorization. Numerical Linear Algebra with applications, Vol. 1, No. 4, (1994) pp. 387–402.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cela, J.M., Alfonso, J.M., Labarta, J. (1996). PLS: A parallel linear solvers library for Domain Decomposition methods. In: Bode, A., Dongarra, J., Ludwig, T., Sunderam, V. (eds) Parallel Virtual Machine — EuroPVM '96. EuroPVM 1996. Lecture Notes in Computer Science, vol 1156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540617795_42
Download citation
DOI: https://doi.org/10.1007/3540617795_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61779-2
Online ISBN: 978-3-540-70741-7
eBook Packages: Springer Book Archive