Parallel method for sparse non-symmetric linear and non-linear systems of equations on a transputer network

Supercomputer

Volumn 12, Issue 4, 1996, Pages 4-15

  Zilli, Giovanni ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004120251     PISSN: 01687875     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Saad, Y., Krylov subspace methods on supercomputers, Siam J. Sci. Stat. Comput. 10, 1200-1232, 1989.
2. Pini, G., Transpose-free Lanczos-type schemes on transputer nehvork, Parallel Algorithms and Applications 3, 1-12, 1994.
3. Zilli, G., Iterative methods for solving sparse linear systems with a parallel preconditioner, Intern. J. Computer Math. 44, 111-119, 1992.
4. Cimmino, G., Calcolo approssimato per le Soluzioni di Equazioni lineari, La Ricerca Scientifica, 326-333, 1938.
5. Kaczmarz, S., Angenaherte Auflosung von Systemen Linearer Gleichungen, Bull Inter. Acad. Polon. Sci. Lett. A, 355-357, 1937.
6. Kamath, C., and A. Sameh, A projection method for solving non-symmetric linear systems on multiprocessors, Parallel Computing 9, 291-312, 1988/89.
7. Arioli, M., I. Duff, J. Noailles, and D. Ruiz, A block projection method for sparse matrices, Siam J. Sci. Stat. Comput. 13 (1), 47-70, 1992.
8. Bramley R., and A. Sameh, Row projections methods for large non-symmetric linear systems, Siam J. Sci. Stat. Comput. 13 (1), 168-193, 1992.
9. Zilli, G., Parallel implementation of a row-projection method for solving sparse linear systems, Supercomputer 53, X-1, 33-43, 1993.
10. Gubin, L.G., B.T. Polyak and E.V. Raik, The method of projections for finding the common point of convex sets, USSR Comp. Math. and Math. Phys. 7, 1-24, 1967.
11. Bjorck, A., and T. Elfving, Accelerated projection methods for computing pseudo-inverse solutions of systems of linear equations, BIT 19, 145-163, 1979.
12. Elfving, T., Block-iterative methods for consistent and inconsistent linear equations, Numer. Math. 35, 1-12, 1980.
13. Hageman, L., and D. Young, Applied Iterative Methods, Academic Press, New York, USA, 1981.
14. Paige, G.G., and M.A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software 8, 43-71, 1982.
15. Zilli G., and I. Moret, Block Quasi-Newton method for sparse non-linear systems of equations on a transputer network, in: Ames, W.F. (ed.), IMACS '94 Proceedings, Late Papers Volume, (Atlanta, July 11-15, 1994) 112-114.
16. Dennis, J.E. Jr., and S. Schnabel, Numerical Methods for Unconstrained Optimization and Non-linear Equations, Prentice-Hall, Englewood Cliffs NJ, USA, 1983.
17. Dembo, R.S., S. C. Eisenstat and T. Steinhaug, Inexact Newton methods, SIAM. J. on Numeric. Anal. 19, 400-408, 1982.
18. Brown P.N., and Y. Saad, Convergence theory of non-linear Newton-Krylov algorithms, Siam J. on Optim. 4, 297-329, 1994.
19. Eisenstat, S.C., H.C., Elman, and M.H. Schultz, Variational iterative methods for non-symmetric systems of linear equations, SIAM J. Numer. Anal. 20, 345-357, 1983.
20. Gomez-Ruggiero, M.A., H. M. Martinez, and A.C. Moretti, Comparing algorithms for solving sparse non-linear systems of equations, SIAM J. Sci. Stat. Comput. 13 (2), 459-483, 1992.
21. Parallel Fortran 77, User Guide, Version 2.1.3, 3L Ltd and EPCL, November 30, 1990.
22. Express Fortran, Reference Guide and Users Guide, Version 3.1, Parasoft Corporation, 1990.