Sufficient condition of a priori estimation for computational complexity of the homotopy method

Mitsunori Makino, Masahide Kashiwagi, Shinichi Oishi, Kazuo Horiuchi

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A priori estimation is presented for a computational complexity of the homotopy method applying to a certain class of strongly monotone nonlinear equations. In the present paper, a condition is presented for a certain class of uniquely solvable equations, under which an upper bound of a computational complexity of the Newton type homotype method can be a priori estimated. In this paper, a condition is considered in a case of linear homotopy equations including the Newton type homotopy equations. In the first place the homotopy algorithm based on the simplified Newton method is introduced. Then by using Urabe type theorem, which gives a sufficient condition guaranteeing the convergence of the simplified Newton method, a condition is presented under which an upper bound of a computational complexity of the algorithm can be a priori estimated, when it is applied to a certain class of strongly monotone nonlinear equations. The presented condition is demonstrated by numerical experiments.

Original languageEnglish
Pages (from-to)786-794
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE76-A
Issue number5
Publication statusPublished - 1993 May
Externally publishedYes

Fingerprint

Homotopy Method
Computational complexity
Computational Complexity
Newton-Raphson method
Nonlinear equations
Sufficient Conditions
Newton Methods
Homotopy
Monotone
Nonlinear Equations
Upper bound
Linear equations
Newton-type Methods
Homotopy Type
Numerical Experiment
Experiments
Theorem
Class

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

@article{8f935120d5a04f42a1b3b8e1674ee775,
title = "Sufficient condition of a priori estimation for computational complexity of the homotopy method",
abstract = "A priori estimation is presented for a computational complexity of the homotopy method applying to a certain class of strongly monotone nonlinear equations. In the present paper, a condition is presented for a certain class of uniquely solvable equations, under which an upper bound of a computational complexity of the Newton type homotype method can be a priori estimated. In this paper, a condition is considered in a case of linear homotopy equations including the Newton type homotopy equations. In the first place the homotopy algorithm based on the simplified Newton method is introduced. Then by using Urabe type theorem, which gives a sufficient condition guaranteeing the convergence of the simplified Newton method, a condition is presented under which an upper bound of a computational complexity of the algorithm can be a priori estimated, when it is applied to a certain class of strongly monotone nonlinear equations. The presented condition is demonstrated by numerical experiments.",
author = "Mitsunori Makino and Masahide Kashiwagi and Shinichi Oishi and Kazuo Horiuchi",
year = "1993",
month = "5",
language = "English",
volume = "E76-A",
pages = "786--794",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - Sufficient condition of a priori estimation for computational complexity of the homotopy method

AU - Makino, Mitsunori

AU - Kashiwagi, Masahide

AU - Oishi, Shinichi

AU - Horiuchi, Kazuo

PY - 1993/5

Y1 - 1993/5

N2 - A priori estimation is presented for a computational complexity of the homotopy method applying to a certain class of strongly monotone nonlinear equations. In the present paper, a condition is presented for a certain class of uniquely solvable equations, under which an upper bound of a computational complexity of the Newton type homotype method can be a priori estimated. In this paper, a condition is considered in a case of linear homotopy equations including the Newton type homotopy equations. In the first place the homotopy algorithm based on the simplified Newton method is introduced. Then by using Urabe type theorem, which gives a sufficient condition guaranteeing the convergence of the simplified Newton method, a condition is presented under which an upper bound of a computational complexity of the algorithm can be a priori estimated, when it is applied to a certain class of strongly monotone nonlinear equations. The presented condition is demonstrated by numerical experiments.

AB - A priori estimation is presented for a computational complexity of the homotopy method applying to a certain class of strongly monotone nonlinear equations. In the present paper, a condition is presented for a certain class of uniquely solvable equations, under which an upper bound of a computational complexity of the Newton type homotype method can be a priori estimated. In this paper, a condition is considered in a case of linear homotopy equations including the Newton type homotopy equations. In the first place the homotopy algorithm based on the simplified Newton method is introduced. Then by using Urabe type theorem, which gives a sufficient condition guaranteeing the convergence of the simplified Newton method, a condition is presented under which an upper bound of a computational complexity of the algorithm can be a priori estimated, when it is applied to a certain class of strongly monotone nonlinear equations. The presented condition is demonstrated by numerical experiments.

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

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

M3 - Article

AN - SCOPUS:0027599503

VL - E76-A

SP - 786

EP - 794

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 5

ER -