Description

Book Synopsis

Iterative Methods without Inversion presents the iterative methods for solving operator equations f(x) = 0 in Banach and/or Hilbert spaces. It covers methods that do not require inversions of f (or solving linearized subproblems). The typical representatives of the class of methods discussed are Ulm's and Broyden's methods. Convergence analyses of the methods considered are based on Kantorovich's majorization principle which avoids unnecessary simplifying assumptions like differentiability of the operator or solvability of the equation. These analyses are carried out under a more general assumption about degree of continuity of the operator than traditional Lipschitz continuity: regular continuity.

Key Features

  • The methods discussed are analyzed under the assumption of regular continuity of divided difference operator, which is more general and more flexible than the traditional Lipschitz continuity.
  • An attention is given to

    Trade Review

    "The book is well organised and clearly written and presents a limited but illustrative number of computational examples that are intended to provide results that can be used to validate the reader's own implementations and to give a sense of how the algorithms perform. It will be accessible to anyone who has reasonable knowledge of basic nonlinear functional analysis.

    Among many other positive features of the book, I especially appreciate the fact that Chapters 2-7 begin with a motivation, give numerical examples and end by stating research project(s), thus enabling and challenging interested readers to pursue further developments. The book will be very useful to graduate students and young researchers beginning their scientific careers in the field of computational mathematics and to anyone else interested in numerical analysis."

    - Vasile Berinde, Mathematical Reviews, August 2017


    "The book is well organised and clearly written and presents a limited but illustrative number of computational examples that are intended to provide results that can be used to validate the reader's own implementations and to give a sense of how the algorithms perform. It will be accessible to anyone who has reasonable knowledge of basic nonlinear functional analysis.

    Among many other positive features of the book, I especially appreciate the fact that Chapters 2-7 begin with a motivation, give numerical examples and end by stating research project(s), thus enabling and challenging interested readers to pursue further developments. The book will be very useful to graduate students and young researchers beginning their scientific careers in the field of computational mathematics and to anyone else interested in numerical analysis."

    - Vasile Berinde, Mathematical Reviews, August 2017



    Table of Contents

    Introduction. Some useful tools of the trade. Ulm’s method. Ulm’s method without derivatives. Broyden’s method. Optimal secantupdates

    of low rank. Optimal secant-type methods. Majorant generators and their convergence domains. Bibliography

Iterative Methods without Inversion

Product form

£147.25

Includes FREE delivery

RRP £155.00 – you save £7.75 (5%)

Order before 4pm tomorrow for delivery by Tue 31 Mar 2026.

A Hardback by Anatoly Galperin

1 in stock


    View other formats and editions of Iterative Methods without Inversion by Anatoly Galperin

    Publisher: Taylor & Francis Inc
    Publication Date: 26/10/2016
    ISBN13: 9781498758925, 978-1498758925
    ISBN10: 1498758924

    Description

    Book Synopsis

    Iterative Methods without Inversion presents the iterative methods for solving operator equations f(x) = 0 in Banach and/or Hilbert spaces. It covers methods that do not require inversions of f (or solving linearized subproblems). The typical representatives of the class of methods discussed are Ulm's and Broyden's methods. Convergence analyses of the methods considered are based on Kantorovich's majorization principle which avoids unnecessary simplifying assumptions like differentiability of the operator or solvability of the equation. These analyses are carried out under a more general assumption about degree of continuity of the operator than traditional Lipschitz continuity: regular continuity.

    Key Features

    • The methods discussed are analyzed under the assumption of regular continuity of divided difference operator, which is more general and more flexible than the traditional Lipschitz continuity.
    • An attention is given to

      Trade Review

      "The book is well organised and clearly written and presents a limited but illustrative number of computational examples that are intended to provide results that can be used to validate the reader's own implementations and to give a sense of how the algorithms perform. It will be accessible to anyone who has reasonable knowledge of basic nonlinear functional analysis.

      Among many other positive features of the book, I especially appreciate the fact that Chapters 2-7 begin with a motivation, give numerical examples and end by stating research project(s), thus enabling and challenging interested readers to pursue further developments. The book will be very useful to graduate students and young researchers beginning their scientific careers in the field of computational mathematics and to anyone else interested in numerical analysis."

      - Vasile Berinde, Mathematical Reviews, August 2017


      "The book is well organised and clearly written and presents a limited but illustrative number of computational examples that are intended to provide results that can be used to validate the reader's own implementations and to give a sense of how the algorithms perform. It will be accessible to anyone who has reasonable knowledge of basic nonlinear functional analysis.

      Among many other positive features of the book, I especially appreciate the fact that Chapters 2-7 begin with a motivation, give numerical examples and end by stating research project(s), thus enabling and challenging interested readers to pursue further developments. The book will be very useful to graduate students and young researchers beginning their scientific careers in the field of computational mathematics and to anyone else interested in numerical analysis."

      - Vasile Berinde, Mathematical Reviews, August 2017



      Table of Contents

      Introduction. Some useful tools of the trade. Ulm’s method. Ulm’s method without derivatives. Broyden’s method. Optimal secantupdates

      of low rank. Optimal secant-type methods. Majorant generators and their convergence domains. Bibliography

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account