Results 181 to 190 of about 289,283 (228)

The Newton‐Raphson method

International Journal of Mathematical Education in Science and Technology, 1995
We start with an historical introduction, and then give an overview of the most important concepts and properties of general iterative methods to solve nonlinear equations. Then we study extensively the Newton‐Raphson method, investigating different sufficient conditions for the Newton‐Raphson method to converge. Finally we look at systems of nonlinear
Johan Verbeke, Ronald Cools
openaire   +1 more source

A generalization of Newton‐Raphson

International Journal of Mathematical Education in Science and Technology, 1984
It is shown that the Newton‐Raphson iteration for nonlinear equations can be considered as a member of a general one‐parameter family of second‐order methods. Variation of the parameter can greatly increase the speed of convergence, and a criterion for choosing the optimal parameter is derived.
openaire   +1 more source

A faster modified newton-raphson iteration

Computer Methods in Applied Mechanics and Engineering, 1979
Abstract The paper describes an accelerated modified Newton-Raphson iteration in which the iterative deflection change is a scalar times the previous iterative change plus a further scalar times the usual unaccelerated change. These scalars are automatically recalculated at each iteration.
openaire   +1 more source

A note on starting the Newton-Raphson method

Communications of the ACM, 1964
Determination of a suitable initial estimate for a root of an equation ƒ( x ) = 0 by means of computing the roots of a sequence of related equations is described.
openaire   +3 more sources

Extended Newton-Raphson Method

2016
In Chap. 7, we have seen that overdetermined nonlinear systems are common in geodetic and geoinformatic applications, that is there are frequently more measurements than it is necessary to determine unknown variables, consequently the number of the variables n is less then the number of the equations m.
Joseph L. Awange, Béla Paláncz
openaire   +1 more source

An Automatic Newton‐Raphson Scheme

International Journal of Geomechanics, 2002
ABSTRACT This article presents an automatic Newton–Raphson method for solving nonlinear finite element equations. It automatically subincrements a series of given coarse load increments so that the local load path error in the displacements is held below a prescribed threshold.
Daichao Sheng, Scott W. Sloan, Andrew J. Abbo   +2 more
openaire   +1 more source

Geometric Newton-Raphson Method

2002
Given an equation y = f (x), the Newton-Raphson method employs successive approximations to determine the roots of the equation f (x) = 0.
openaire   +1 more source

A stochastic Newton-Raphson method

Journal of Statistical Planning and Inference, 1978
Abstract A stochastic approximation procedure of the Robbins-Monro type is considered. The original idea behind the Newton-Raphson method is used as follows. Given n approximations X 1 ,…, X n with observations Y 1 ,…, Y n , a least squares line is fitted to the points ( X m , Y m ),…, ( X n , Y n ) where m n may ...
openaire   +1 more source

An Asynchronous Newton-Raphson Method

1990
We consider a parallel variant of the Newton-Raphson method for unconstrained optimization, which uses as many finite differences of gradients as possible to approximate rows and columns of the inverse Hessian matrix. The method is based on the Gauss-Seidel type of updating for quasi-Newton methods originally proposed by Straeter (1973).
openaire   +1 more source

The Newton–Raphson method

2021
openaire   +2 more sources