close menu
Bookswagon-24x7 online bookstore
close menu
My Account
18%
Iterative Algorithms II

Iterative Algorithms II

          
5
4
3
2
1

In Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Add to Wishlist

About the Book

The study of iterative methods began several years ago in order to find the solutions of problems where mathematicians cannot find a solution in closed form. In this way, different studies related to different methods with different behaviors have been presented over the last decades. Convergence conditions have become one of the most studied topics in recent mathematical research. One of the most well-known conditions are the Kantorovich conditions, which has allowed many researchers to experiment with all kinds of conditions. In recent years, several authors have studied different modifications of the mentioned conditions considering inter alia, Holder conditions, alpha-conditions or even convergence in other spaces. In this monograph, the authors present the complete work within the past decade on convergence and dynamics of iterative methods. It acts as an extension of their related publications in these areas. The chapters are self-contained and can be read independently. Moreover, an extensive list of references is given in each chapter, in order to allow the reader to refer to previous ideas. For these reasons, several advanced courses can be taught using this book. This book intends to find applications in many areas of applied mathematics, engineering, computer science and real problems. As such, this monograph is suitable for researchers, graduate students and seminars in the above subjects, and it would be an excellent addition to all science and engineering libraries.

Table of Contents:
Preface; Convergence of Halley's Method Under Centered Lipschitz Condition on the Second Frechet Derivative; Semilocal Convergence of Steffensen-type Algorithms; Some Weaker Extensions of the Kantorovich Theorem for Solving Equations; Improved Convergence Analysis of Newton's Methods; Extending the Applicability of Newton's Method; Extending the Applicability of Newton's Method for Sections in Riemannian Manifolds; Two-step Newton Methods; Discretized Newton-Tikhonov Method; Relaxed Secant-type Methods; Newton-Kantorovich Method for Analytic Operators; Iterative Regularization Methods for Ill-posed Hammerstein Type Operator Equations; Local Convergence of a Fifth Order Method in Banach Space; Local Convergence of the Gauss-Newton Method; Expanding the Applicability of the Gauss-Newton Method for Convex Optimization Under a Majorant Condition; An Analysis of Lavrentiev Regularization Methods & Newton-type Iterative Methods for Nonlinear Ill-posed Hammerstein-type Equations; Local Convergence of a Multi-point-parameter Newton-like Methods in Banach Space; On an Iterative Method for Unconstrained Optimization; Inexact two-point Newton-like Methods Under General Conditions; Index.


Best Sellers



Product Details
  • ISBN-13: 9781634858793
  • Publisher: Nova Science Publishers Inc
  • Publisher Imprint: Nova Science Publishers Inc
  • Edition: Mathematics Research Developme
  • Language: English
  • Returnable: N
  • Weight: 746 gr
  • ISBN-10: 1634858794
  • Publisher Date: 01 May 2017
  • Binding: Hardback
  • Height: 260 mm
  • No of Pages: 360
  • Spine Width: 24 mm
  • Width: 180 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Iterative Algorithms II
Nova Science Publishers Inc -
Iterative Algorithms II
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Iterative Algorithms II

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA