Extensive studies have been carried out on the homotopy continuation algorithms which constructively determine the solution of nonlinear equations. However, their execution speed is greatly decreased when the system of equations becomes large. A decomposition method and acceleration techniques are introduced in order to improve the computational efficiency of the homotopy algorithms. A new algorithm is presented in which the system of equations is decomposed by A. K. Kevorkian's (1981) method, and then a simplicial method, which is a typical homotopy algorithm, is applied. It is shown that this algorithm has local quadratic convergence under some suitable conditions. Application of the algorithm to nonlinear two-point boundary value problems is also discussed and an efficient mesh refinement strategy is given. 10 refs.
|ジャーナル||Proceedings - IEEE International Symposium on Circuits and Systems|
|出版ステータス||Published - 1985 12 1|
ASJC Scopus subject areas