Parallel Algorithms for Nonlinear Problems
Author:
- R. E. WhiteRWR. E. White
- 1 January 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 7 (1) , 137-149
Abstract
Multi-splittings of a matrix are used to generate parallel algorithms to approximate the solutions of nonlinear algebraic systems. A parallel nonlinear Gauss–Seidel algorithm for approximating the solution of $Au + \phi ( u ) = f$ where A is an M-matrix is introduced and studied. Also, a parallel Newton–SOR method is defined for the problem $F ( u ) = 0$ where $F' ( u ) = $ the Jacobian is an M-matrix. An illustration and comparison of these methods with their serial versions is given. The speed-up on the Denelcor HEP parallel processing computer is also recorded.
Keywords
This publication has 4 references indexed in Scilit:
- Multi-Splittings of Matrices and Parallel Solution of Linear SystemsSIAM Journal on Algebraic Discrete Methods, 1985
- NONNEGATIVE MATRICES1979
- On Newton-Iterative Methods for the Solution of Systems of Nonlinear EquationsSIAM Journal on Numerical Analysis, 1978
- Iterative Solution of Linear Equations on a Parallel Processor SystemIEEE Transactions on Computers, 1977