Skip to main content
Book cover

Iterative Solution of Large Sparse Systems of Equations

  • Book
  • © 2016

Overview

  • New edition provides emphasis on the algebraic structure of linear iteration, not usually included in most literature
  • Completely renewed references
  • Content grew out of a series of lectures given by author
  • Extensive and useful appendices included
  • Includes supplementary material: sn.pub/extras

Part of the book series: Applied Mathematical Sciences (AMS, volume 95)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 69.99 USD 149.00
53% discount Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 89.99 USD 199.99
55% discount Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 89.99 USD 199.99
55% discount Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (14 chapters)

  1. Linear Iterations

  2. Semi-Iterations and Krylov Methods

  3. Special Iterations

Keywords

About this book

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature.


The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms.


The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.


Authors and Affiliations

  • Max Planck Institute for Mathematics in, Leipzig, Germany

    Wolfgang Hackbusch

About the author

Wolfgang Hackbusch is a Professor in the Scientific Computing department at Max Planck Institute for Mathematics in the Sciences. His research areas include numerical treatment of partial differential equations, numerical treatment of integral equations, and hierarchical matrices.

Bibliographic Information

Publish with us