Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
On Ssub.n Iteration for Fixed Points of -Operators with Numerical Analysis and Polynomiography
by
Ciobanescu, Cristian
in
Fixed point theory
/ Iterative methods (Mathematics)
/ Numerical analysis
/ Operator theory
2025
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
On Ssub.n Iteration for Fixed Points of -Operators with Numerical Analysis and Polynomiography
by
Ciobanescu, Cristian
in
Fixed point theory
/ Iterative methods (Mathematics)
/ Numerical analysis
/ Operator theory
2025
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
On Ssub.n Iteration for Fixed Points of -Operators with Numerical Analysis and Polynomiography
Journal Article
On Ssub.n Iteration for Fixed Points of -Operators with Numerical Analysis and Polynomiography
2025
Request Book From Autostore
and Choose the Collection Method
Overview
The first part of this study is related to the search of fixed points for (E )-operators (Garcia-Falset operators), in the Banach setting, by means of a three-step iteration procedure. The main results reveal some conclusions related to weak and strong convergence of the considered iterative scheme toward a fixed point. On the other hand, the usefulness of the Sn iterative scheme is once again revealed by demonstrating through numerical simulations the advantages of using it for solving the problem of the maximum modulus of complex polynomials compared to standard algorithms, such as Newton, Halley, or Kalantary’s so-called B [sub.4] iteration.
Publisher
MDPI AG
This website uses cookies to ensure you get the best experience on our website.