Skip to content

Convergence of relaxed Newton method for order-convex matrix equations

Document Type
Publications · Journal Article
Registered DB
SCIEScopus
Journal Ranking
JCR Q2Scopus Q2
Citation
Web of Science 2Scopus 2
FWCI (Scopus)
0
JCR IF
JCR 2019 1.36
ISSN
2238-3603

Authors

  1. Sang-Hyup SeoFirst authorCorresponding authorDepartment of Mathematics, Pusan National University, Busan, 46241, Republic of Korea
  2. Seo, Jong-HyeonChubu University Academy of Emerging Science, Kasugai, 487-0027, Japan

Abstract

In this paper, we suggest singular monotone Newton theorem and a relaxed Newton method for a nonlinear matrix equation F(X)=0 where F is an order-convex matrix function. At first, we introduce monotone Newton theorem from Ortega and Rheinboldt (SIAM, 2000), and we show singular monotone Newton theorem which shows that the Newton sequence converges to a solution of F(X)=0 even if the Frechet derivative at the solution is singular. At last, we provide a relaxed Newton method for F(X)=0 which is better than the pure Newton method and we give some numerical experiments for the relaxed Newton method.

Keywords

Order-convex functionNonlinear matrix equationNewton methodRelaxed Newton methodWIENER-HOPF FACTORIZATIONITERATIVE SOLUTIONRICCATI-EQUATIONSALGORITHMTIME

Identifiers

Scopus EID
2-s2.0-85076915746
WoS UID
000511710100001