This is an advanced textbook based on lectures delivered at the Moscow Physico-Technical Institute. Brevity, logical organization of the material, and a sometimes lighthearted approach are distinctive features of this modest book. The author makes the reader an active participant by asking questions, hinting, giving direct recommendations, comparing different methods, and discussing "pessimistic" and "optimistic" approaches to numerical analysis in a short time. Since matrix analysis underlies numerical methods and the author is an expert in this field, emphasis in the book is on methods and algorithms of matrix analysis. Also considered are function approximations, methods of solving nonlinear equations and minimization methods. Alongside classical methods, new results and approaches developed over the last few years are discussed - namely those on spectral distribution theory and what it gives for design and proof of modern preconditioning strategies for large-scale linear algebra problems. Advanced students and graduate students majoring in computer science, physics and mathematics will find this book helpful. It can be equally useful for advanced readers and researchers in providing them with new findings and new accessible views of the basic mathematical framework.

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.

A logically organized advanced textbook, which turns the reader into an active participant by asking questions, hinting, giving direct recommendations, comparing different methods, and discussing "pessimistic" and "optimistic" approaches to numerical analysis. Advanced students and graduate students majoring in computer science, physics and mathematics will find this book helpful.

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.