Comparing Quasi-Newton Methods for Solving Sparse Interface Problems

摘要

Quasi Newton methods for interface problems which arise from domain decompositionmethods are examined. These interface problems are usually sparse systems of linear or nonlinear equations. Particular interest is the application of the methods to systems of linear equations where the Jacobian matrices cannot be calculated or it is not wished to calculate them. The suitability of implementing these algorithms on coarse grained parallel computers is examined.