Stepsize selection in continuation procedures and damped Newton's method
نویسندگان
چکیده
منابع مشابه
Stepsize Selection for Approximate Value Iteration and a New Optimal Stepsize Rule
Approximate value iteration is used in dynamic programming when we use random observations to estimate the value of being in a state. These observations are smoothed to approximate the expected value function, leading to the problem of choosing a stepsize (the weight given to the most recent observation). A stepsize of 1/n is a common (and provably convergent) choice. However, we prove that it ...
متن کاملFuzzy multi-criteria selection procedures in choosing data source
Technology assessment and selection has a substantial impact on organizations procedures in regards to technology transfer. Technological decisions are usually made by a group of experts, and whereby integrity of these viewpoints to a single decision can be quite complex. Today, operational databases and data warehouses exist to manage and organize data with specific features and henceforth, th...
متن کاملStepsize selection for tolerance proportionality in explicit Runge-Kutta codes
The potential for adaptive explicit Runge–Kutta (ERK) codes to produce global errors that decrease linearly as a function of the error tolerance is studied. It is shown that this desirable property may not hold, in general, if the leading term of the locally computed error estimate passes through zero. However, it is also shown that certain methods are insensitive to a vanishing leading term. M...
متن کاملHydrothermal Optimal Power Flow Using Continuation Method
The problem of optimal economic operation of hydrothermal electric power systems is solved using powerful continuation method. While in conventional approach, fixed generation voltages are used to avoid convergence problems, in the proposed algorithm, they are treated as variables so that better solutions can be obtained. The algorithm is tested for a typical 5-bus and 17-bus New Zealand networ...
متن کاملAnalysis of Stepsize Selection Schemes for Runge - Kutta Codes
Conditions on Runge-Kutta algorithms can be obtained which ensure smooth stepsize selection when stability of the algorithm is restricting the stepsize. Some recently derived results are shown to hold for a more general test problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1989
ISSN: 0377-0427
DOI: 10.1016/0377-0427(89)90148-9