Sciweavers

1997 search results - page 17 / 400
» On the convergence of Hill's method
Sort
View
107
Voted
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 25 days ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
87
Voted
ANOR
2008
53views more  ANOR 2008»
15 years 26 days ago
A globally convergent inexact Newton method with a new choice for the forcing term
In inexact Newton methods for solving nonlinear systems of equations, an approximation to the step sk of the Newton's system J(xk)s = -F(xk) is found. This means that sk must...
Márcia A. Gomes-Ruggiero, Véra Lucia...
SIAMNUM
2011
95views more  SIAMNUM 2011»
14 years 7 months ago
A General Convergence Analysis of Some Newton-Type Methods for Nonlinear Inverse Problems
We consider the methods xδ n+1 = xδ n − gαn (F (xδ n)∗F (xδ n))F (xδ n)∗(F (xδ n)− yδ) for solving nonlinear ill-posed inverse problems F (x) = y using the only ava...
Qinian Jin
119
Voted
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 6 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz