Matrix Preconditioning Techniques and Applications


Book Description

A comprehensive introduction to preconditioning techniques, now an essential part of successful and efficient iterative solutions of matrices.




Iterative Methods and Preconditioners for Systems of Linear Equations


Book Description

Iterative methods use successive approximations to obtain more accurate solutions. This book gives an introduction to iterative methods and preconditioning for solving discretized elliptic partial differential equations and optimal control problems governed by the Laplace equation, for which the use of matrix-free procedures is crucial. All methods are explained and analyzed starting from the historical ideas of the inventors, which are often quoted from their seminal works. Iterative Methods and Preconditioners for Systems of Linear Equations grew out of a set of lecture notes that were improved and enriched over time, resulting in a clear focus for the teaching methodology, which derives complete convergence estimates for all methods, illustrates and provides MATLAB codes for all methods, and studies and tests all preconditioners first as stationary iterative solvers. This textbook is appropriate for undergraduate and graduate students who want an overview or deeper understanding of iterative methods. Its focus on both analysis and numerical experiments allows the material to be taught with very little preparation, since all the arguments are self-contained, and makes it appropriate for self-study as well. It can be used in courses on iterative methods, Krylov methods and preconditioners, and numerical optimal control. Scientists and engineers interested in new topics and applications will also find the text useful.




Iterative Methods and Preconditioning for Large and Sparse Linear Systems with Applications


Book Description

This book describes, in a basic way, the most useful and effective iterative solvers and appropriate preconditioning techniques for some of the most important classes of large and sparse linear systems. The solution of large and sparse linear systems is the most time-consuming part for most of the scientific computing simulations. Indeed, mathematical models become more and more accurate by including a greater volume of data, but this requires the solution of larger and harder algebraic systems. In recent years, research has focused on the efficient solution of large sparse and/or structured systems generated by the discretization of numerical models by using iterative solvers.







Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs


Book Description

Preconditioning and the Conjugate Gradient Method in the Context of Solving PDEs?is about the interplay between modeling, analysis, discretization, matrix computation, and model reduction. The authors link PDE analysis, functional analysis, and calculus of variations with matrix iterative computation using Krylov subspace methods and address the challenges that arise during formulation of the mathematical model through to efficient numerical solution of the algebraic problem. The book?s central concept, preconditioning of the conjugate gradient method, is traditionally developed algebraically using the preconditioned finite-dimensional algebraic system. In this text, however, preconditioning is connected to the PDE analysis, and the infinite-dimensional formulation of the conjugate gradient method and its discretization and preconditioning are linked together. This text challenges commonly held views, addresses widespread misunderstandings, and formulates thought-provoking open questions for further research.?




Matrix Methods: Theory, Algorithms And Applications - Dedicated To The Memory Of Gene Golub


Book Description

Compared to other books devoted to matrices, this volume is unique in covering the whole of a triptych consisting of algebraic theory, algorithmic problems and numerical applications, all united by the essential use and urge for development of matrix methods. This was the spirit of the 2nd International Conference on Matrix Methods and Operator Equations from 23-27 July 2007 in Moscow that was organized by Dario Bini, Gene Golub, Alexander Guterman, Vadim Olshevsky, Stefano Serra-Capizzano, Gilbert Strang and Eugene Tyrtyshnikov.Matrix methods provide the key to many problems in pure and applied mathematics. However, linear algebra theory, numerical algorithms and matrices in FEM/BEM applications usually live as if in three separate worlds. In this volume, maybe for the first time ever, they are compiled together as one entity as it was at the Moscow meeting, where the algebraic part was impersonated by Hans Schneider, algorithms by Gene Golub, and applications by Guri Marchuk. All topics intervened in plenary sessions are specially categorized into three sections of this volume.The soul of the meeting was Gene Golub, who rendered a charming “Golub's dimension” to the three main axes of the conference topics. This volume is dedicated in gratitude to his memory.




Model Order Reduction: Theory, Research Aspects and Applications


Book Description

The idea for this book originated during the workshop “Model order reduction, coupled problems and optimization” held at the Lorentz Center in Leiden from S- tember 19–23, 2005. During one of the discussion sessions, it became clear that a book describing the state of the art in model order reduction, starting from the very basics and containing an overview of all relevant techniques, would be of great use for students, young researchers starting in the ?eld, and experienced researchers. The observation that most of the theory on model order reduction is scattered over many good papers, making it dif?cult to ?nd a good starting point, was supported by most of the participants. Moreover, most of the speakers at the workshop were willing to contribute to the book that is now in front of you. The goal of this book, as de?ned during the discussion sessions at the workshop, is three-fold: ?rst, it should describe the basics of model order reduction. Second, both general and more specialized model order reduction techniques for linear and nonlinear systems should be covered, including the use of several related numerical techniques. Third, the use of model order reduction techniques in practical appli- tions and current research aspects should be discussed. We have organized the book according to these goals. In Part I, the rationale behind model order reduction is explained, and an overview of the most common methods is described.




Iterative Methods for Linear Systems


Book Description

Iterative Methods for Linear Systems?offers a mathematically 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 algorithmic and mathematical perspectives, and going beyond the standard description of iterative methods by connecting them in a natural way to the idea of preconditioning.??




Matrix Analysis and Computations


Book Description

This comprehensive book is presented in two parts; the first part introduces the basics of matrix analysis necessary for matrix computations, and the second part presents representative methods and the corresponding theories in matrix computations. Among the key features of the book are the extensive exercises at the end of each chapter. Matrix Analysis and Computations provides readers with the matrix theory necessary for matrix computations, especially for direct and iterative methods for solving systems of linear equations. It includes systematic methods and rigorous theory on matrix splitting iteration methods and Krylov subspace iteration methods, as well as current results on preconditioning and iterative methods for solving standard and generalized saddle-point linear systems. This book can be used as a textbook for graduate students as well as a self-study tool and reference for researchers and engineers interested in matrix analysis and matrix computations. It is appropriate for courses in numerical analysis, numerical optimization, data science, and approximation theory, among other topics