Performance analysis of partition algorithms for parallel solution of nonlinear systems of equations

We discuss performance of partition algorithms for parallel solution of large-scale nonlinear systems of equations. We describe first a block Broyden algorithm for solving a nonlinear system in which a diagonal matrix is used as an iterative matrix. Then, we analyze the parallelism of the algorithm and discuss in details different partitioning schemes. Finally, we give some numerical results and analyze performance of the partitioning schemes. The numerical results show that the algorithms combining block Broyden method with partitioning techniques are effective, and that they can be used in the large-scale problems arising from scientific and engineering computing.