Progress curves of enzyme-catalysed reactions are described by equations of a type that precludes direct calculation of the extent of reaction at any time. Previously, such equations have been solved by the Newton-Raphson method, but this procedure may fail when based upon the usual formulae. An alternative formulation is proposed that is both quicker and more robust.

In lifetime analysis of electric transformers, the maximum likelihood estimation has been proposed with the EM algorithm. However, it is not clear whether the EM algorithm offers a better solution compared to the simpler Newton-Raphson algorithm. In this paper, the first objective is a systematic comparison of the EM algorithm with the Newton-Raphson algorithm in terms of convergence performanc...

Introduction we aimed to introduce a 6-universal-prismatic-spherical (UPS) parallel mechanism for the human jaw motion and theoretically evaluate its kinematic problem. We proposed a strategy to provide a fast and accurate solution to the kinematic problem. The proposed strategy could accelerate the process of solution-finding for the direct kinematic problem by reducing the number of required ...

This paper considers parameter estimation of superimposed exponential signals in multiplicative and additive noise which are all independent and identically distributed. A modified Newton–Raphson algorithm is used to estimate the frequencies of the considered model, which is further used to estimate other linear parameters. It is proved that the modified Newton– Raphson algorithm is robust and ...

The performance of Newton-Raphson, LevenbergMarquardt, Damped Newton-Raphson and genetic algorithms are investigated for the estimation of induction motor equivalent circuit parameters from commonly available manufacturer data. A new hybrid algorithm is then proposed that combines the advantages of both descent and natural optimisation algorithms. Through computer simulation, the hybrid algorit...

We consider the distributed unconstrained minimization of separable convex cost functions, where the global cost is given by the sum of several local and private costs, each associated to a specific agent of a given communication network. We specifically address an asynchronous distributed optimization technique called Newton-Raphson Consensus. Beside having low computational complexity, low co...

The paper presents an algorithm of adaptation by successive mesh regeneration and its application to the potential nonlinear flow problems. The Newton-Raphson method is applied to the solution of nonlinear problem. The Kutta-Zhukovsky condition is implemented by the penalty function method. The adaptation algorithm is based on the modification of mesh size function depending on the error indica...

A nite element formulation to deal with the friction contact problem between an elastic body and a rigid foundation is presented. An augmented Lagrangian method, which incorporates two Lagrange multipliers and a slack variable in the constraint equation, is developed. In this method, the solution is achieved through a Newton-Raphson monolithic iterative strategy and leads to simple implementati...