A Study of Discrete Newton Method
碩士 === 中原大學 === 數學研究所 === 86 === The main result of this note is to prove the following global convergence theorem for discrete Newton's method in (Z/2)^n.Theorem : Let d be a root of F (x)=0,i.e.H(d)=d,where H(x)=x (+)[inverse A (*) F(x)].If for each x in (Z/2)^n,H(neighborhood o...
Main Authors: | Wang Feng-Wang, 王瑞鋒 |
---|---|
Other Authors: | Shih Mau-Hsiang |
Format: | Others |
Language: | zh-TW |
Published: |
1997
|
Online Access: | http://ndltd.ncl.edu.tw/handle/17699290506258071069 |
Similar Items
-
Newton Methods For Machine Learning
by: Chien-Chih Wang, et al.
Published: (2016) -
From Kepler to Newton──Analysis of Newton’s Geometric Arguments
by: Jia-Ching Wang, et al.
Published: (2007) -
Randomized Newton’s Method for Solving Differential Equations Based on the Neural Network Discretization
by: Chen, Q., et al.
Published: (2022) -
Discrete Newton's Algorithm for Parametric Submodular Function Minimization
by: Goemans, Michel X, et al.
Published: (2018) -
Newton's Method
by: Banacka, Nicole Lynn
Published: (2013)