DECOMPOSITION METHOD AND ACCELERATION TECHNIQUES FOR A FIXED POINT ALGORITHM.

Kiyotaka Yamamura, Shinichi Oishi, Kazuo Horiuchi

Research output: Contribution to journalArticle

Abstract

Recently, extensive studies have been carried out on the algorithms which constructively determine the solution of nonlinear equations. This paper proposes a decomposition method and acceleration techniques as means to improve the computational efficiency of the fixed-point algorithms. Kevorkian's method is used in this paper as decomposition. Accuracy of simplicial approximation and convergence properties of the algorithm are discussed, indicating that the algorithm exhibits local quadratic convergence under some suitable conditions. By numerical examples, it is verified that the algorithm exhibits quadratic convergence.

Original language English 1-9 9 Electronics & communications in Japan 67 10 Published - 1984 Oct

Fingerprint

Decomposition
Computational efficiency
Nonlinear equations

ASJC Scopus subject areas

• Engineering(all)

Cite this

DECOMPOSITION METHOD AND ACCELERATION TECHNIQUES FOR A FIXED POINT ALGORITHM. / Yamamura, Kiyotaka; Oishi, Shinichi; Horiuchi, Kazuo.

In: Electronics & communications in Japan, Vol. 67, No. 10, 10.1984, p. 1-9.

Research output: Contribution to journalArticle

@article{1977df39167f47d9b47a6f527af53964,
title = "DECOMPOSITION METHOD AND ACCELERATION TECHNIQUES FOR A FIXED POINT ALGORITHM.",
abstract = "Recently, extensive studies have been carried out on the algorithms which constructively determine the solution of nonlinear equations. This paper proposes a decomposition method and acceleration techniques as means to improve the computational efficiency of the fixed-point algorithms. Kevorkian's method is used in this paper as decomposition. Accuracy of simplicial approximation and convergence properties of the algorithm are discussed, indicating that the algorithm exhibits local quadratic convergence under some suitable conditions. By numerical examples, it is verified that the algorithm exhibits quadratic convergence.",
author = "Kiyotaka Yamamura and Shinichi Oishi and Kazuo Horiuchi",
year = "1984",
month = "10",
language = "English",
volume = "67",
pages = "1--9",
journal = "Electronics and Communications in Japan",
issn = "0424-8368",
publisher = "Scripta Pub Co.",
number = "10",

}

TY - JOUR

T1 - DECOMPOSITION METHOD AND ACCELERATION TECHNIQUES FOR A FIXED POINT ALGORITHM.

AU - Yamamura, Kiyotaka

AU - Oishi, Shinichi

AU - Horiuchi, Kazuo

PY - 1984/10

Y1 - 1984/10

N2 - Recently, extensive studies have been carried out on the algorithms which constructively determine the solution of nonlinear equations. This paper proposes a decomposition method and acceleration techniques as means to improve the computational efficiency of the fixed-point algorithms. Kevorkian's method is used in this paper as decomposition. Accuracy of simplicial approximation and convergence properties of the algorithm are discussed, indicating that the algorithm exhibits local quadratic convergence under some suitable conditions. By numerical examples, it is verified that the algorithm exhibits quadratic convergence.

AB - Recently, extensive studies have been carried out on the algorithms which constructively determine the solution of nonlinear equations. This paper proposes a decomposition method and acceleration techniques as means to improve the computational efficiency of the fixed-point algorithms. Kevorkian's method is used in this paper as decomposition. Accuracy of simplicial approximation and convergence properties of the algorithm are discussed, indicating that the algorithm exhibits local quadratic convergence under some suitable conditions. By numerical examples, it is verified that the algorithm exhibits quadratic convergence.

UR - http://www.scopus.com/inward/record.url?scp=0021501862&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021501862&partnerID=8YFLogxK

M3 - Article

VL - 67

SP - 1

EP - 9

JO - Electronics and Communications in Japan

JF - Electronics and Communications in Japan

SN - 0424-8368

IS - 10

ER -