Browsing by Subject "order"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
Item type:Thesis, Access status: Restricted , Pewne przykłady nieprzeliczalnych rodzin podzbiorów zbioru $\mathbb{N}$(Data obrony: 2010-07-07) Mardosz, Barbara
Wydział Matematyki StosowanejItem type:Article, Access status: Open Access , Some efficient seventh-order derivative-free families in root-finding(2013) Soleymani, FazlollahThe interest in efficient root-finding iterations is nowadays growing and influenced by the widespread use of high-speed computers. On the other hand, the calculation of derivatives is often hard, when the problems are formulated in terms of nonlinear equations and as a result, the importance of derivative-free methods emerges. For these reasons, some efficient three-step families of iterations for solving nonlinear equations are suggested, where the analytical proofs show their seventh-order error equations consuming only four function evaluations per iteration. We employ hard numerical test problems to illustrate the accuracy of the new methods from the families.
