Behavior of the Parallel Code Method

スポンサーリンク

概要

• 論文の詳細を見る

• Parallel Code Method (PCM) is one of iterative methods for solving nonlinear equations. The method uses an initial constant matrix instead of Jacobi matrix at every iteration. First, the notion of local convergence for PCM is defined and a sufficient condition for local convergence is given. Secondly, it is shown that the approximations generated by PCM are represented by an infinite power series under the condition that a root of the nonlinear equation is not multiple. Next, based on this property, the sequence of approximations of PCM is accelerated and a better approximation of a root is estimated. Finally, it is verified by numerical examples that the sequence is accelerated according to the property.

• 福山大学の論文

著者

• IIJIMA Taizo

  Souken

• Iijima Taizo

  Souken Institute Inc.

• OZEKI Takashi

  Department of Information Processing Engineering, Fukuyma University

• Ozeki Takashi

  Department Of Information Processing Engineering Fukuyma University

関連論文

• OK-QUANTIZATION THEORY AND ITS RELATIONSHIP TO SAMPLING THEOREM(International Workshop on Advanced Image Technology 2007)
• OK-QUANTIZATION THEORY AND ITS RELATIONSHIP TO SAMPLING THEOREM
• A RELATIONSHIP BETWEEN OK-QUANTIZATION THEORY AND SAMPLING THEOREM AND SOME EXPERIMENTAL CONSIDERATIONS(International Workshop on Advanced Image Technology 2006)
• Behavior of the Parallel Code Method
• On the Gaussian Scale-Space(Special Issue on Multiresolution Analysis)

スポンサーリンク