Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Iterative Methods for Linear Systems

Iterative Methods for Linear Systems

Iterative Methods for Linear Systems

Theory and Applications
Authors:
Maxim A. Olshanskii, University of Houston
Eugene E. Tyrtyshnikov, Moscow State University
Published:
February 2027
Availability:
Not yet published - no date available
Format:
Paperback
ISBN:
9781611973457

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

$85.00
(P) USD
Paperback

    Systems of linear equations are ubiquitous in numerical analysis and scientific computing. and iterative methods are indispensable for the numerical treatment of such systems. This book offers a rigorous introduction to fundamental iterative methods for systems of linear algebraic equations. The book distinguishes itself from other texts on the topic by providing a straightforward yet comprehensive analysis of the Krylov subspace methods, approaching the development and analysis of algorithms from various perspectives, and going beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning. The book supplements standard texts on numerical mathematics for first-year graduate and advanced undergraduate courses and is suitable for advanced graduate classes covering numerical linear algebra and Krylov subspace and multigrid iterative methods. It will be useful to researchers interested in numerical linear algebra and engineers who use iterative methods for solving large algebraic systems.

    • Provides a straightforward yet comprehensive analysis of the Krylov subspace methods
    • Approaches the development and analysis of iteration schemes from various algorithmic and mathematical perspectives
    • Goes beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning

    Product details

    February 2027
    Paperback
    9781611973457
    260 pages
    254 × 177 × 15 mm
    0.56kg
    Not yet published - no date available

    Table of Contents

    • List of figures
    • List of algorithms
    • Preface
    • 1. Krylov subspace methods
    • 2. Toeplitz matrices and preconditioners
    • 3. Multigrid preconditioners
    • 4. Preconditioners by space decomposition
    • 5. Some applications
    • Bibliography
    • Index.
      Authors
    • Maxim A. Olshanskii , University of Houston

      Maxim A. Olshanskii is a professor in the Department of Mathematics at the University of Houston and an adjunct professor at Emory University and Moscow Institute of Physics and Technology. He is the Managing Editor of the Journal of Numerical Mathematics and 2001 recipient of the Young Scientists Award of the European Academy of Sciences.

    • Eugene E. Tyrtyshnikov , Moscow State University

      Eugene E. Tyrtyshnikov is Director of the Institute of Numerical Mathematics of the Russian Academy of Sciences and Professor and Chairman at the Faculty of Computational Mathematics and Cybernetics of Moscow State University. He became a Corresponding Member of the Russian Academy of Sciences in 2006. He serves as associate editor of Linear Algebra and Its Applications and as a member of editorial boards of seven other journals.