Abstract
Parallel Krylov (S-step and block) iterative methods for linear systems have been studied and implemented in the past. In this article we present a parallel Krylov method based on block s-step method for nonsymmetric linear systems. Wederive two new averaging algorithm to combine several approximations to the solution of a single linear system using the block method with multiple initial guesses. We implement the new methods with ILU preconditioners on a parallel computer. We test the accuracy and present performance results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Axelsson, O.: Iterative Solution Methods. Cambridge University Press, (1996)
Broyden, C.G.: Block Conjugate Gradient Methods. Optimization methods and Software, 2(1993) 1–17
Calvetti, D., Reichel L.: Application of a block modified Chebyshev algorithm to the iterative solution of symmetric linear systems with multiple right-hand side vectors. Numer. Math. 68(1994), 3–16
Chronopoulos, A.T.: S-step Iterative Methods for (Non)symmetric (In)definite Linear Systems. SIAM J. on Num. Analysis, No. 6, 28(1991) 1776–1789.
Chronopoulos, A.T., Swanson, C.D.: Parallel Iterative S-step Methods for Unsymmetric Linear Systems. Parallel Computing. Volume 22/5, (1996) 623–641
Hackbush, W.: A parallel variant of the conjugate gradient method. Applied Mathematical Sciences, 95. Springer-Verlag, New-York, (1994) 111–119
Meurant, G.: Computer Solution of Large Linear Systems. Elsevier (1999)
Nikishin, A.A., Yeremin, A.Y.: Variable block CG algorithms for solving large sparse symmetric positive definite linear systems on parallel computers, I: General iterative scheme. SIAM J. Matrix Anal. Appl. 16(1995) 1135–1153
Papadrakakis M., Smerou, S.: A new implementation of the Lanczos method in linear problems. Internat. J. Numer. Methods Engrg., 29(1990) 141–159
Parlett, B.N.: A new look at the Lanczos and the block-Lanczos methods. SIAM J. Numer. Anal., 17(1980) 687–706
Radicati di Brozolo, G., Robert, Y.: Parallel conjugate gradient-like algorithms for sparse nonsymmetric systems on a vector multiprocessor. Parallel Computing, 11(1989) 223–239
Sadkane, M., Vital, B.: Davidson’s Method for Linear Systems of Equations. Implementation of a Block Algorithm on a Multi-processor. Tech. Rept. TR/PA/91/60, CERFACS, Toulouse, (1991)
Simon, H., Yeremin, A.: New Approach to Construction of Efficient Iterative Schemes for Massively Parallel Applications: Variable Block CG and BiCG Methods and Variable Block Arnoldi Procedure. Proc. of the 6th SIAM Conference on Parallel Proc. for Scientific Computing, ed. by R. Sincovec et al., SIAM, Philadelphia, (1993) 57–60
Simoncini, V., Gallopoulos, E.: An iterative method for nonsymmetric systems with multiple right hand sides. SIAM J. Sci. Stat. Comput., 16(1995) 917–933
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chronopoulos, A.T., Kucherov, A.B. (2001). A Parallel Krylov-Type Method for Nonsymmetric Linear Systems. In: Monien, B., Prasanna, V.K., Vajapeyam, S. (eds) High Performance Computing — HiPC 2001. HiPC 2001. Lecture Notes in Computer Science, vol 2228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45307-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-45307-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43009-4
Online ISBN: 978-3-540-45307-9
eBook Packages: Springer Book Archive