Results 151 to 160 of about 10,998,730 (181)

A numerical study of non-Newtonian blood-based hybrid nanofluid flow over a stretching cylinder with Cattaneo-Christov heat flux and homogeneous heterogeneous reactions. [PDF]

Discov Nano
Ali L, Shah S, Alhazmi SE, Abualnaja KM, Elattar S.   +4 more
europepmc   +1 more source

Thermodynamic and Transport Properties of Alkanes (C_nH_2n+2; n = 5-8). [PDF]

ChemistryOpen
Awasthi D, Gautam N, Khanal SP, Koirala RP, Adhikari NP.   +4 more
europepmc   +1 more source

Competency and Confidence in Qualitative Biomechanical Assessment of Exercise Technique Among Exercise Professionals. [PDF]

J Strength Cond Res
Petushek E, Breen S, Myer GD, Dupuis BP, Dorgo S, Ebben W, Krosshaug T.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Expanding the applicability of Newton’s method and of a robust modified Newton’s method

Applicationes Mathematicae, 2021
Summary: Newton's method cannot be used to approximate a solution of a nonlinear equation when the derivative of the function is singular or almost singular. To overcome this problem a modified Newton's method may be used. The Newton-Kantorovich theorem is used to show its convergence. The convergence domain of this method is small in general.
Argyros, Ioannis K., George, Santhosh
openaire   +2 more sources

Inexact Newton Methods

SIAM Journal on Numerical Analysis, 1982
A classical algorithm for solving the system of nonlinear equations $F(x) = 0$ is Newton’s method \[ x_{k + 1} = x_k + s_k ,\quad {\text{where }}F'(x_k )s_k = - F(x_k ),\quad x_0 {\text{ given}}.\]...
Dembo, Ron S., Eisenstat, Stanley C., Steihaug, Trond   +2 more
openaire   +1 more source

On the Gauss–Newton method

Journal of Applied Mathematics and Computing, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Argyros, Ioannis K., Hilout, Saïd
openaire   +1 more source

On Newton's method for polynomials

27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 1986
Let Pd be the set of polynomials over the complex numbers of degree d with all its roots in the unit ball. For f ∈ Pd, let Γf be the set of points for which Newton's method converges to a root, and let Af ≡ |Γf ∩ B2(O)|/|B2(O)|, i.e. the density of Γf in the ball of radius 2. For each d we consider Ad, the worst-case density Af for f ∈ Pd.
openaire   +1 more source

A parameterized Newton method and a quasi-Newton method for nonsmooth equations

Computational Optimization and Applications, 1994
Two methods are discussed for solving nonsmooth equations. The first method, a parametrized Newton method, uses a damping parameter for the Newton step and a regularization parameter for the chosen member of the generalized Jacobian, and, therefore, is well-defined even when the generalized Jacobian is singular.
Xiaojun Chen 0001, Liqun Qi 0001
openaire   +2 more sources

Perturbation Lemma for the Newton Method with Application to the SQP Newton Method

Journal of Optimization Theory and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cores, D., Tapia, R. A.
openaire   +1 more source

GENERALIZATIONS OF NEWTON'S METHOD

Fractals, 2001
We give a survey of the complex dynamics of various generalizations of Newton's method for finding a complex root of a polynomial of a single variable.
openaire   +2 more sources