본문 바로가기

Convergence of relaxed Newton method for order-convex matrix equations

문서 유형
연구출판물 · 학술지 논문
등재
SCIEScopus
저널 순위
JCR Q2Scopus Q2
피인용
Web of Science 2Scopus 2
FWCI (Scopus)
0
JCR IF
JCR 2019 1.36
ISSN
2238-3603

저자

  1. 서상협제1저자교신저자Department of Mathematics, Pusan National University, Busan, 46241, Republic of Korea
  2. Seo, Jong-HyeonChubu University Academy of Emerging Science, Kasugai, 487-0027, Japan

초록

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.

키워드

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

식별자

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