نتایج جستجو برای: newton technique

تعداد نتایج: 629883  

Journal: :iranian journal of numerical analysis and optimization 0
jalal izadian reza abrishami maryam jalili

a new approach utilizing newton method and homotopy analysis method (ham) is proposed for solving nonlinear system of equations. accelerating the rate of convergence of ham, and obtaining a global quadratic rate of convergence are the main purposes of this approach. the numerical results demonstrate the efficiency and the performance of proposed approach. the comparison with conventional homoto...

Journal: :SIAM J. Scientific Computing 2011
Xiao-Chuan Cai Xuefeng Li

The classical inexact Newton algorithm is an efficient and popular technique for solving large sparse nonlinear system of equations. When the nonlinearities in the system are wellbalanced, a near quadratic convergence is often observed, however, if some of the equations are much more nonlinear than the others in the system, the convergence is much slower. The slow convergence (or sometimes dive...

Abedian S Ahmadi SM Pahlevanzadeh S Valiani M

Background: Infertility effects on psychological and emotional tension in couples and make severe stress in infertile men and women. Relaxation technique is one of the methods which reduce stress and balance human emotions. The purpose of this study was determination of relaxation effect on stress score in the infertile women and pregnancy test as outcome of their treatment. Materials and Metho...

Journal: :Symmetry 2017
Dong Wang Hualing Ren Fubo Shao

Various distributed optimization methods have been developed for consensus optimization problems in multi-agent networks. Most of these methods only use gradient or subgradient information of the objective functions, which suffer from slow convergence rate. Recently, a distributed Newton method whose appeal stems from the use of second-order information and its fast convergence rate has been de...

1997
ZHI WANG KELVIN K. DROEGEMEIER I. M. NAVON

The adjoint Newton algorithm (ANA) is based on the firstand second-order adjoint techniques allowing one to obtain the ‘‘Newton line search direction’’ by integrating a ‘‘tangent linear model’’ backward in time (with negative time steps). Moreover, the ANA provides a new technique to find Newton line search direction without using gradient information. The error present in approximating the Hes...

<span style="color: #333333; font-family: Calibri, sans-serif; font-size: 13.3333px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff; text-dec...

2002
M. S. Al-Haik H. Garmestani

We present an estimate approach to compute the viscoplastic behavior of a polymeric composite under different thermomechanical approaches. This investagation incorporates computational neural network as the tool for determining the creep behaviour of the composite. We propose a new second-order learning algorithm for training the multilayer networks. Training in the neural network is generally ...

2003
Takao Hinamoto Hiroaki Ohnishi Wu-Sheng Lu

A new approach to the problem of minimizing L2sensitivity subject to L2-norm scaling constraints for state-space digital filters is proposed. Using linearalgebraic techniques, the problem at hand is converted into an unconstrained optimization problem, and the unconstrained problem obtained is then solved by applying an efficient quasi-Newton algorithm. Computer simulation results are presented...

2006
J. A. Ezquerro M. A. Hernández Luis de Ulloa

A new technique is used instead of the classical majorant principle to analyze the R-order of convergence of the Newton process when more general conditions than the Kantorovich ones are considered. © 2005 Elsevier B.V. All rights reserved. MSC: 47H17; 65J15

Journal: :bulletin of the iranian mathematical society 0
m. ahookhosh faculty of mathematics‎, ‎university of vienna‎, ‎oskar-morge-nstern-platz 1‎, ‎1090 vienna‎, ‎austria. k. amini department of‎ ‎mathematics‎, ‎razi university‎, ‎kermanshah‎, ‎iran. m. kimiaei department of‎ ‎mathematics‎, ‎asadabad branch‎, ‎islamic azad university‎, ‎asadabad‎, ‎iran. m. r. ‎peyghami k.n. toosi university of department of‎ ‎mathematics‎, ‎k‎. ‎n‎. ‎toosi university of technology‎, ‎p.o‎. ‎box 16315-1618‎, ‎tehran‎, ‎iran.

this study concerns with a trust-region-based method for solving unconstrained optimization problems. the approach takes the advantages of the compact limited memory bfgs updating formula together with an appropriate adaptive radius strategy. in our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-newt...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید