Substitution-Newton-Raphson method applied to the modeling of a vapour compression refrigeration system using different representations of the thermodynamic properties of R-134a

This paper gives a detailed presentation of the Substitution-Newton-Raphson method, suitable for large sparse non-linear systems. It combines the Successive Substitution method and the Newton-Raphson method in such way as to take the best advantages of both, keeping the convergence features of the Newton-Raphson with the low requirements of memory and time of the Successive Substitution schemes. The large system is solved employing few effective variables, using the greatest possible part of the model equations in substitution fashion to fix the remaining variables, but maintaining the convergence characteristics of the Newton-Raphson. The methodology is exemplified through a simple algebraic system, and applied to a simple thermodynamic, mechanical and heat transfer modeling of a single-stage vapor compression refrigeration system. Three distinct approaches for reproducing the thermodynamic properties of the refrigerant R-134a are compared: the linear interpolation from tabulated data, the use of polynomial fitted curves and the use of functions derived from the Helmholtz free energy.

A new approach to the solution of the optimal power flow problem based on the modified Newton's method associated to an augmented Lagrangian function

This paper presents a new algorithm for optimal power flow problem. The algorithm is based on Newton's method which it works with an Augmented Lagrangian function associated with the original problem. The function aggregates all the equality and inequality constraints and is solved using the modified-Newton method. The test results have shown the effectiveness of the approach using the IEEE 30 and 638 bus systems.

Substitution-newton-Raphson method for the solution of electric network equations

The power flow problem, in transmission networks, has been well solved, for most cases, using Newton-Raphson method (NR) and its decoupled versions. Generally speaking, the solution of a non-linear system of equations refers to two methods: NR and Successive Substitution. The proposal of this paper is to evaluate the potential of the Substitution-Newton-Raphson Method (SNR), which combines both methods, on the solution of the power flow problem. Simulations were performed using a two-bus test network in order to observe the characteristics of these methods. It was verified that the NR is faster than SNR, in terms of convergence, considering non-stressed scenarios. For those cases where the power flow in the network is closed to the limits (stressed system), the SNR converges faster. This paper presents the power flow formulation of the SNR and describes its potential for its application in special cases such as stressed scenarios. © 2006 IEEE.

A Newton method for pose refinement of 3D models

Different optimization methods can be employed to optimize a numerical estimate for the match between an instantiated object model and an image. In order to take advantage of gradient-based optimization methods, perspective inversion must be used in this context. We show that convergence can be very fast by extrapolating to maximum goodness-of-fit with Newton's method. This approach is related to methods which either maximize a similar goodness-of-fit measure without use of gradient information, or else minimize distances between projected model lines and image features. Newton's method combines the accuracy of the former approach with the speed of convergence of the latter.

A gamma camera count rate saturation correction method for whole-body planar imaging.

Whole-body (WB) planar imaging has long been one of the staple methods of dosimetry, and its quantification has been formalized by the MIRD Committee in pamphlet no 16. One of the issues not specifically addressed in the formalism occurs when the count rates reaching the detector are sufficiently high to result in camera count saturation. Camera dead-time effects have been extensively studied, but all of the developed correction methods assume static acquisitions. However, during WB planar (sweep) imaging, a variable amount of imaged activity exists in the detector's field of view as a function of time and therefore the camera saturation is time dependent. A new time-dependent algorithm was developed to correct for dead-time effects during WB planar acquisitions that accounts for relative motion between detector heads and imaged object. Static camera dead-time parameters were acquired by imaging decaying activity in a phantom and obtaining a saturation curve. Using these parameters, an iterative algorithm akin to Newton's method was developed, which takes into account the variable count rate seen by the detector as a function of time. The algorithm was tested on simulated data as well as on a whole-body scan of high activity Samarium-153 in an ellipsoid phantom. A complete set of parameters from unsaturated phantom data necessary for count rate to activity conversion was also obtained, including build-up and attenuation coefficients, in order to convert corrected count rate values to activity. The algorithm proved successful in accounting for motion- and time-dependent saturation effects in both the simulated and measured data and converged to any desired degree of precision. The clearance half-life calculated from the ellipsoid phantom data was calculated to be 45.1 h after dead-time correction and 51.4 h with no correction; the physical decay half-life of Samarium-153 is 46.3 h. Accurate WB planar dosimetry of high activities relies on successfully compensating for camera saturation which takes into account the variable activity in the field of view, i.e. time-dependent dead-time effects. The algorithm presented here accomplishes this task.

Newton`s iterates can converge to non-stationary points

In this note we discuss the convergence of Newton`s method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hessian is positive definite at each step and yet the iterates converge to a non-stationary point. These examples answer a question posed by Fletcher in his 1987 book Practical methods of optimization.

Improving ultimate convergence of an augmented Lagrangian method

Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented Lagrangian are useful tools for solving nonlinear programming problems. Their reputation decreased in the last 10 years due to the comparative success of interior-point Newtonian algorithms, which are asymptotically faster. In this research, a combination of both approaches is evaluated. The idea is to produce a competitive method, being more robust and efficient than its `pure` counterparts for critical problems. Moreover, an additional hybrid algorithm is defined, in which the interior-point method is replaced by the Newtonian resolution of a Karush-Kuhn-Tucker (KKT) system identified by the augmented Lagrangian algorithm. The software used in this work is freely available through the Tango Project web page:http://www.ime.usp.br/similar to egbirgin/tango/.

Computational study of the step size parameter of the subgradient optimization method

The subgradient optimization method is a simple and flexible linear programming iterative algorithm. It is much simpler than Newton's method and can be applied to a wider variety of problems. It also converges when the objective function is non-differentiable. Since an efficient algorithm will not only produce a good solution but also take less computing time, we always prefer a simpler algorithm with high quality. In this study a series of step size parameters in the subgradient equation is studied. The performance is compared for a general piecewise function and a specific p-median problem. We examine how the quality of solution changes by setting five forms of step size parameter.

Notes on Newton-Euler formulation of robotic manipulators

The equations corresponding to Newton-Euler iterative method for the determination of forces and moments acting on the rigid links of a robotic manipulator are given a new treatment using composed vectors for the representation of both kinematical and dynamical quantities. It is shown that Lagrange equations for the motion of a holonomic system are easily found from the composed vectors defined in this note. Application to a simple model of an industrial robot shows that the method developed in these notes is efficient in solving the dynamics of a robotic manipulator. An example is developed, where it is seen that with the application of appropriate control moments applied to each arm of the robot, starting from a given initial position, it is possible to reach equilibrium in a final pre-assigned position.

Alternative parameters for the continuation power flow method

The conventional Newton's method has been considered inadequate to obtain the maximum loading point (MLP) of power systems. It is due to the Jacobian matrix singularity at this point. However, the MLP can be efficiently computed through parameterization techniques of continuation methods. This paper presents and tests new parameterization schemes, namely the total power losses (real and reactive), the power at the slack bus (real or reactive), the reactive power at generation buses, the reactive power at shunts (capacitor or reactor), the transmission lines power losses (real and reactive), and transmission lines power (real and reactive). Besides their clear physical meaning, which makes easier the development and application of continuation methods for power systems analysis, the main advantage of some of the proposed parameters is that its not necessary to change the parameter in the vicinity of the MLP. Studies on the new parameterization schemes performed on the IEEE 118 buses system show that the ill-conditioning problems at and near the MLP are eliminated. So, the characteristics of the conventional Newton's method are not only preserved but also improved. (C) 2003 Elsevier B.V. B.V. All rights reserved.

Modified barrier method for optimal power flow problem

In this paper is presented a new approach for optimal power flow problem. This approach is based on the modified barrier function and the primal-dual logarithmic barrier method. A Lagrangian function is associated with the modified problem. The first-order necessary conditions for optimality are fulfilled by Newton's method, and by updating the barrier terms. The effectiveness of the proposed approach has been examined by solving the Brazilian 53-bus, IEEE118-bus and IEEE162-bus systems.

Optimal power flow via interior-exterior method

This paper presents a new approach to the resolution of the Optimal Power Flow problem. In this approach the inequality constraints are treated by the Modified Barrier and Primal-Dual Logarithmic Barrier methods. The inequality constraints are transformed into equalities by introducing positive auxiliary variables, which are perturbed by the barrier parameter. A Lagrangian function is associated with the modified problem. The first-order necessary conditions are applied to the Lagrangian, generating a nonlinear system which is solved by Newton's method. The perturbation of the auxiliary variables results in an expansion of the feasible set of the original problem, allowing the limits of the inequality constraints to be reached. Numerical tests on the Brazilian CESP and South-Southeast systems and a comparative test indicated that the new approach efficiently resolves of the Optimal Power Flow problem. © 2007 IEEE.

Reversibility Iteration Method to Understand Reaction Networks and to Solve Micro-Kinetics in Heterogeneous Catalysis

Solving microkinetics of catalytic systems, which bridges microscopic processes and macroscopic reaction rates, is currently vital for understanding catalysis in silico. However, traditional microkinetic solvers possess several drawbacks that make the process slow and unreliable for complicated catalytic systems. In this paper, a new approach, the so-called reversibility iteration method (RIM), is developed to solve microkinetics for catalytic systems. Using the chemical potential notation we previously proposed to simplify the kinetic framework, the catalytic systems can be analytically illustrated to be logically equivalent to the electric circuit, and the reaction rate and coverage can be calculated by updating the values of reversibilities. Compared to the traditional modified Newton iteration method (NIM), our method is not sensitive to the initial guess of the solution and typically requires fewer iteration steps. Moreover, the method does not require arbitrary-precision arithmetic and has a higher probability of successfully solving the system. These features make it ∼1000 times faster than the modified Newton iteration method for the systems we tested. Moreover, the derived concept and the mathematical framework presented in this work may provide new insight into catalytic reaction networks.