Results 11 to 20 of about 11,063,462 (189)
Polarization Dynamics in Ferroelectrics: Insights Enabled by Machine Learning Molecular Dynamics. [PDF]
Adv Sci (Weinh)Machine learning molecular dynamics is presented as a route to capture polarization switching, domain wall kinetics, topological polar textures, and polar mechanical coupling beyond the limits of conventional atomistic methods. This Perspective surveys recent progress and identifies key methodological directions, including long‐range electrostatics ...
Bai D, He R, Liu J, Kou L.
europepmc +2 more sources
Relaxing convergence conditions for Newton's method. [PDF]
, 2000 The classical Kantorovich theorem on Newton's method assumes that the first derivative of the operator involved satisfies a Lipschitz condition 0[F(x)-F(y)]Lx-y. In this paper, we weaken this condition, assuming that 0[F(x)-F(x0)](x-x0) for a given point
Hernández, M.A.
core +2 more sources
Convergence of the relaxed Newton's method [PDF]
, 2014 In this work we study the local and semilocal convergence of the relaxed Newton's method, that is Newton's method with a relaxation parameter 0 < λ < 2.
Argyros, I.K. +3 more
core +1 more source
Generalized Differentiability Conditions for Newton's Method. [PDF]
, 2002 The use of majorizing sequences is the usual way to prove the convergence of Newton's method. An alternative technique to majorizing sequences is provided in this paper, in which three scalar sequences are used, so that the analysis of convergence is ...
Ezquerro, J.A. [0000-0001-8120-167X] +1 more
core +1 more source
Majorizing sequences for Newton's method from initial value problems [PDF]
, 2012 The most restrictive condition used by Kantorovich for proving the semilocal convergence of Newton's method in Banach spaces is relaxed in this paper, providing we can guarantee the semilocal convergence in situations that Kantorovich cannot.
Hernández, null [0000-0001-5478-2958] +2 more
core +1 more source
Evolving Fuzzy Rules for Relaxed-Criteria Negotiation [PDF]
, 2008 In the literature on automated negotiation, very few negotiation agents are designed with the flexibility to slightly relax their negotiation criteria to reach a consensus more rapidly and with more certainty.
Sim, Kwang Mong, Kwang Mong Sim
core +1 more source
On a Convex Acceleration of Newton's Method [PDF]
, 1999 In this study, we use a convex acceleration of Newton's method (or super-Halley method) to approximate solutions of nonlinear equations. We provide sufficient convergence conditions for this method in three space settings: real line, complex plane, and ...
J. A. Ezquerro +3 more
core +1 more source
Measures of the Basins of Attracting n-Cycles for the Relaxed Newton's Method
, 2020 The relaxed Newton's method modifies the classical Newton's method with a parameter h in such a way that when it is applied to a polynomial with multiple roots and we take as parameter one of these multiplicities, it is increased the order of convergence
Magreñán, Á. Alberto +3 more
core +1 more source
Attracting cycles for the relaxed Newton’s method [PDF]
, 2011 We study the relaxed Newton’s method applied to polynomials. In particular, we give a technique such that for any n≥2, we may construct a polynomial so that when the method is applied to a polynomial, the resulting rational function has an attracting ...
Romero, N. [0000-0002-0653-560X] +5 more
core +1 more source
Newton's method under weak Kantorovich conditions [PDF]
, 2000 The classical Kantorovich theorem on Newton's method assumes that the derivative of the operator involved satisfies a Lipschitz condition ∥F′(x) - F′(y)∥ ≤ L∥x - y∥. In this paper we weaken this condition, assuming that ∥F′(x) - F′(x 0)∥ ≤ L∥x - x 0∥ for
Gutiérrez, J.M. [0000-0002-0434-7250] +1 more
core +1 more source