๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Krylov Subspace Methods: Principles and Analysis

โœ Scribed by Jorg Liesen, Zdenek Strakos


Publisher
Oxford University Press
Year
2012
Tongue
English
Leaves
408
Series
Numerical Mathematics and Science Computation
Edition
1
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


The mathematical theory of Krylov subspace methods with a focus on solving systems of linear algebraic equations is given a detailed treatment in this principles-based book. Starting from the idea of projections, Krylov subspace methods are characterised by their orthogonality and minimisation properties. Projections onto highly nonlinear Krylov subspaces can be linked with the underlying problem of moments, and therefore Krylov subspace methods can be viewed as matching moments model reduction. This allows enlightening reformulations of questions from matrix computations into the language of orthogonal polynomials, Gauss-Christoffel quadrature, continued fractions, and, more generally, of Vorobyev's method of moments. Using the concept of cyclic invariant subspaces, conditions are studied that allow the generation of orthogonal Krylov subspace bases via short recurrences. The results motivate the important practical distinction between Hermitian and non-Hermitian problems. Finally, the book thoroughly addresses the computational cost while using Krylov subspace methods. The investigation includes effects of finite precision arithmetic and focuses on the method of conjugate gradients (CG) and generalised minimal residuals (GMRES) as major examples.

There is an emphasis on the way algebraic computations must always be considered in the context of solving real-world problems, where the mathematical modelling, discretisation and computation cannot be separated from each other. The book also underlines the importance of the historical context and demonstrates that knowledge of early developments can play an important role in understanding and resolving very recent computational problems. Many extensive historical notes are included as an inherent part of the text as well as the formulation of some omitted issues and challenges which need to be addressed in future work.

This book is applicable to a wide variety of graduate courses on Krylov subspace methods and related subjects, as well as benefiting those interested in the history of mathematics.

โœฆ Subjects


Applied Biomathematics Differential Equations Game Theory Graph Linear Programming Probability Statistics Stochastic Modeling Vector Analysis Mathematics Science Math Matrices Algebra Trigonometry Calculus Geometry New Used Rental Textbooks Specialty Boutique


๐Ÿ“œ SIMILAR VOLUMES


Krylov Subspace Methods for Linear Syste
โœ Tomohiro Sogabe ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Springer ๐ŸŒ English

<p><span>This book focuses on Krylov subspace methods for solving linear systems, which are known as one of the top 10 algorithms in the twentieth century, such as Fast Fourier Transform and Quick Sort (SIAM News, 2000). Theoretical aspects of Krylov subspace methods developed in the twentieth centu

Krylov Subspace Methods for Linear Syste
โœ Tomohiro Sogabe ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› Springer Nature ๐ŸŒ English

This book focuses on Krylov subspace methods for solving linear systems, which are known as one of the top 10 algorithms in the twentieth century, such as Fast Fourier Transform and Quick Sort (SIAM News, 2000). Theoretical aspects of Krylov subspace methods developed in the twentieth century are ex

The Matrix Eigenvalue Problem: GR and Kr
โœ David S. Watkins ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

After working on the reduction of IC interconnect networks for months, I am eager to find a book about matrix eigenvalue computations. Although there are several famous bibles in this field, like "The Algebraic Eigenvalue Problem" by James Wilkinson, they are not so up-to-date that some important to

The Matrix Eigenvalue Problem: GR and Kr
โœ David S. Watkins ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

This book presents the first in-depth, complete, and unified theoretical discussion of the two most important classes of algorithms for solving matrix eigenvalue problems: QR-like algorithms for dense problems and Krylov subspace methods for sparse problems. The author discusses the theory of the ge

The Matrix Eigenvalue Problem: GR and Kr
โœ David S. Watkins ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

The first in-depth, complete, and unified theoretical discussion of the two most important classes of algorithms for solving matrix eigenvalue problems: QR-like algorithms for dense problems and Krylov subspace methods for sparse problems. The author discusses the theory of the generic GR algorithm,