نتایج جستجو برای: eight order convergence

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

2013
M. Matinfar

In this paper, modification of Steffensen’s method with eight-order convergence is presented. We propose a family of optimal three-step methods with eight-order convergence for solving the simple roots of nonlinear equations by using the weight function and interpolation methods. Per iteration this method requires four evaluations of the function which implies that the efficiency index of the d...

Journal: :Rocky Mountain Journal of Mathematics 1980

Journal: :Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 1982

Journal: :نظریه تقریب و کاربرد های آن 0
m. paripour department of mathematics, islamic azad university, hamedan branch , hamedan, 6518118413, iran. j. saeidian department of mathematics and computer science, tarbiat moallem university, 599 taleghani avenue, tehran 1561836314, iran.

omotopy analysis method (ham) is a promising method for handling func-tional equations. recent publications proved the e ectiveness of ham in solvingwide variety of problems in di erent elds. ham has a unique property whichmakes it superior to other analytic methods, this property is its ability to con-trol the convergence region of the solution series. in this work, we clari ed theadvantages ...

Journal: :Proceedings of the American Mathematical Society 1973

Journal: :European Journal of Combinatorics 2017

Journal: :Combinatorics, Probability and Computing 2015

Journal: :Conformal Geometry and Dynamics of the American Mathematical Society 2011

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه پیام نور - دانشگاه پیام نور استان تهران - دانشکده علوم ریاضی و مهندسی کامپیوتر 1392

heuristics are often used to provide solutions for flow shop scheduling problems.the performance of a heuristic is usually judged by comparing solutions and run times on test cases.this investigation proposes an analytical alternative ,called asymptotic convergence ,which tests the convergence of the heuristic to a lower bound as problem size grows. the test is a stronger variation of worst cas...

2014
T. Lotfi K. Mahdiani Z. Noori F. Khaksar Haghani S. Shateyi

A class of derivative-free methods without memory for approximating a simple zero of a nonlinear equation is presented. The proposed class uses four function evaluations per iteration with convergence order eight. Therefore, it is an optimal three-step scheme without memory based on Kung-Traub conjecture. Moreover, the proposed class has an accelerator parameter with the property that it can in...

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

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