به جمع مشترکان مگیران بپیوندید!

تنها با پرداخت 70 هزارتومان حق اشتراک سالانه به متن مقالات دسترسی داشته باشید و 100 مقاله را بدون هزینه دیگری دریافت کنید.

برای پرداخت حق اشتراک اگر عضو هستید وارد شوید در غیر این صورت حساب کاربری جدید ایجاد کنید

عضویت
جستجوی مقالات مرتبط با کلیدواژه

with-memory method

در نشریات گروه ریاضی
تکرار جستجوی کلیدواژه with-memory method در نشریات گروه علوم پایه
تکرار جستجوی کلیدواژه with-memory method در مقالات مجلات علمی
  • Vali Torkashvand *, Manochehr Kazemi
    In this paper,a new family of eighth-order iterative methods for solving simple roots of nonlinear equations is developed.Each member of the proposed family requires four functional evaluations in each iteration that it is optimal according to the sense of Kung-Traub’s conjecture.They have four self-accelerating parameters that are calculated using the adaptive method.The R-order of convergence has increased from 8 to 16 (maximum improvement).
    Keywords: With-Memory Method, Accelerator Parameter, Weight Function, R-Order Of Convergence, Nonlinear Equations
  • Vali Torkashvand *, Manochehr Kazemi, Masoud Azimi
    In this work, we have proposed a general manner to extend some two-parametric with-memory methods to obtain simple roots of nonlinear equations. Novel improved methods are two-step without memory and have two self-accelerator parameters that do not have additional evaluation. The methods have been compared with the nearest competitions in various numerical examples. Anyway, the theoretical order of convergence is verified. The basins of attraction of the suggested methods are presented and corresponded to explain their interpretation.
    Keywords: With-Memory Method, Basin Of Attraction, Accelerator Parameter, $R$-Order Convergence, Nonlinear Equations
  • Vali Torkashvand *
    In this paper, the degree of convergence of Newton’s method has been increased from two to four using two function evaluations. For this purpose,the weakness of Newton’s method, derivative calculation has been eliminated with a proper approximation of the previous data. Then, by entering two selfaccelerating parameters, the family new with-memory methods with Steffensen-Like memory with convergence orders of 2.41, 2.61, 2.73, 3.56, 3.90, 3.97, and 4 are made. This goal has been achieved by approximating the self-accelerator parameters by using the secant method and Newton interpolation polynomials.Finally, we have examined the dynamic behavior of the proposed methods for solving polynomial equations.
    Keywords: With-memory method, Accelerator parameter, Basin of attraction, Efficiency index, Newton’s interpolatory polynomial
  • Vali Torkashvand*, Manochehr Kazemi, Mandana Moccari

    In this work, we will first propose an optimal three-step without-memory method for solving nonlinear equations. Then, by introducing the self-accelerating parameters, the with-memory-methods have been built. They have a fifty-nine percentage improvement in the convergence order. The proposed methods have not the problems of calculating the function derivative. We use these Steffensen- type methods to solve nonlinear equations with simple zeroes with the appropri- ate initial approximation of the root. we have solved a few nonlinear problems to justify the theoretical study. Finally, are described the dynamics of the with- memory method for complex polynomials of degree two.

    Keywords: With-memory method, Basin of attraction, Accelerator parameter, R- order convergence, Nonlinear equations
نکته
  • نتایج بر اساس تاریخ انتشار مرتب شده‌اند.
  • کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شده‌است. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
  • در صورتی که می‌خواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.
درخواست پشتیبانی - گزارش اشکال