Parallel iterative S-step methods for unsymmetric linear systems

Parallel Computing

Volumn 22, Issue 5, 1996, Pages 623-641

  Chronopoulos, A T ^a   Swanson, C D ^b  

^a Wayne State University   (United States)

^b CRAY INC   (United States)

Author keywords

Cray c90; Iterative methods; Modified gram schmidt; S step orthomin

Indexed keywords

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; DIGITAL ARITHMETIC; ITERATIVE METHODS; LINEAR ALGEBRA; MATRIX ALGEBRA; NUMERICAL ANALYSIS; NUMERICAL METHODS; VECTORS;

CRAY C90; GENERALIZED CONJUGATE RESIDUAL; MODIFIED GRAM-SCHMIDT METHOD; ORTHOMIN; S STEP METHODS; UNSYMMETRIC LINEAR SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0030211546     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(96)00022-1     Document Type: Article

References (31)

1. E. Anderson et al., LAPACK Users' Guide, (SIAM, Philadelphia, 1992).
2. O. Axelsson, A generalized conjugate gradient, Least squares method, Numer. Math. 51 (1987) 209-227.
3. N (Elsevier, North Holland, Amsterdam, 1988).
4. P.N. Brown, A theoretical comparison of the Arnoldi and GMRES algorithms, SIAM J. Sci. Stat. Comput. 12(1) (1991) 58-78.
5. C.G. Broyden, Block conjugate gradient methods, Optimization methods and Software 2 (1993) 1-17.
6. A.T. Chronopoulos and C.W. Gear, S-step iterative methods for symmetric linear systems, Journal of Computational and Applied Mathematics 25 (1989) 153-168.
7. A.T. Chronopoulos and C.W. Gear, Implementation of preconditioned S-step conjugate gradient methods on a multiprocessor system with memory hierarchy, Parallel Computing 11 (1989) pp. 37-53.
8. A.T. Chronopoulos, S-step iterative methods for (non)symmetric (in)definite linear systems, SIAM J. on Num. Analysis 28(6) (1991) 1776-1789.
9. J.W. Demmel, M.T. Heath and H. van Der Vorst, Parallel Numerical Linear Algebra (Acta Numerica 2, Cambridge University Press, 1993).
10. E. de Sturler, A parallel variant of GMRES(m), in: J. Miller and R. Vichnevetsky, eds., Proc. of the 13th IMACS World Congress on Computation and Applied Math. (Criterion Press, Dublin, 1991) 682-683.
11. J.J. Dongarra and R.E Hiromoto, A collection of parallel linear equations routines for the Denelcor HEP, Parallel Computing 1 (1984) 133-142.
12. J.J. Dongarra, I.S. Duff, D.C. Sorensen, and H.A. van der Vorst, Solving Linear Systems on Vector and Shared Memory Parallel Computers (SIAM publications, 1991).
13. S.C. Eisenstat, H.C. Elman and M.H. Schultz, Variational iterative methods for nonsymmetric systems of linear equations, SIAM J. Numer. Anal. 20 (1983) 345-357.
14. K. Gallivan, M. Heath, E. Ng, J. Ortega, B. Peyton, R. Plemmons, C. Romine, A. Sameh and R. Voigt, Parallel Algorithms for Dense Linear Algebra Computations (SIAM, Philadelphia, 1990).
15. A. Greenbaum and Z. Strakos, Matrices that generate the same Krylov varieties, Institute of Mathematics and its Applications Volumes in Applied Mathematics, vol. 60, 1994.
16. S.K. Kim and A.T. Chronopoulos, A class of Lanczos-like algorithms implemented on parallel computers, Parallel Computing 17 (1991) 763-778.
17. S.K. Kim and A.T. Chronopoulos, An efficient nonsymmetric Lanczos on parallel vector computers, J. of Comput. and Applied Math. 42 (1992) 357-374.
18. S.K. Kim and A.T. Chronopoulos, An efficient parallel algorithm for extreme eigenvalues of sparse nonsymmetric matrices, The Int. J. on Supercomputing 6(1) (1992) 98-111.
19. S. Ma and A.T. Chronopoulos, Implementation of iterative methods for large sparse nonsymmetric linear systems on parallel vector computers, Int. J. on Supercomputing 4(4) (1990) 9-24.
20. N.M. Nachtigal, S.C. Reddy and L.N. Trefethen, How fast are non-symmetric matrix iterations?, SIAM J. Matrix Anal. Appl. 13(3) (1992) 778-795.
21. G. Radicati di Brozolo, Y. Robert, Parallel conjugate gradient-like algorithms for sparse nonsymmetric systems on a vector multiprocessor, Parallel Computing 11 (1989) 223-239.
22. M. Sadkane and B. Vital, Davidson's method for linear systems of equations, Implementation of a block algorithm on a Multi-processor, Technical Report TR/PA/91/60, CERFACS, Toulouse, 1991.
23. V. Simoncini and E. Gallopoulos, An iterative method for nonsymmetric systems with multiple right hand sides, SIAM J. Sci. Stat. Comput. 16 (1995) 917-933.
24. V. Simoncini and E. Gallopoulos, Convergence properties of block GM-RES and matrix polynomials, to appear in: Linear Algebra and its Applications, also: Center for Supercomputing Research and Development, Technical Report No. 1316, April 1994.
25. D.C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl. 13 (1992) 357-385.
26. H. van der Vorst, A vectorizable variant of some ICGG methods, SIAM J. Sci. Stat. Comput. 3 (1982) 350-356.
27. P. Vinsome, An iterative method for solving sparse sets of simultaneous equations (Society of Petroleum Engineers of AIME, SPE 5729, 1976).
28. H.F. Walker, Implementation of the GMRES method using householder transformations, SIAM J. Sci. Stat. Comput. 9 (1988) 152-163.
29. A.M. Wissink, A.S. Lyrintzis and A.T. Chronopoulos, Efficient iterative methods applied to the solution of transonic flows, J. of Computational Physics 123 (1996).
30. D.M. Young and D.R. Kincaid, The ITPACK software package, in: B. Engquist and T. Smedsaas, eds., PDE SOFTWARE: MODULES, INTERFACES AND SYSTEMS (North Holland, Amsterdam, 1984) 193-206.
31. Z. Zlatev, Computational Methods for General Sparse Matrices (Kluwer Academic Publishers, 1991).