Krylov Methods for Nonsymmetric Linear Systems From Theory to Computations

This book aims to give an encyclopedic overview of the state-of-the-art of Krylov subspace iterative methods for solving nonsymmetric systems of algebraic linear equations and to study their mathematical properties. Solving systems of algebraic linear equations is among the most frequent problems in...

Full description

Bibliographic Details
Main Authors: Meurant, Gérard, Duintjer Tebbens, Jurjen (Author)
Format: eBook
Language:English
Published: Cham Springer International Publishing 2020, 2020
Edition:1st ed. 2020
Series:Springer Series in Computational Mathematics
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03357nmm a2200289 u 4500
001 EB001904088
003 EBX01000000000000001066994
005 00000000000000.0
007 cr|||||||||||||||||||||
008 201103 ||| eng
020 |a 9783030552510 
100 1 |a Meurant, Gérard 
245 0 0 |a Krylov Methods for Nonsymmetric Linear Systems  |h Elektronische Ressource  |b From Theory to Computations  |c by Gérard Meurant, Jurjen Duintjer Tebbens 
250 |a 1st ed. 2020 
260 |a Cham  |b Springer International Publishing  |c 2020, 2020 
300 |a XIV, 686 p. 184 illus  |b online resource 
505 0 |a 1. Notation, definitions and tools -- 2. Q-OR and Q-MR methods -- 3. Bases for Krylov subspaces -- 4. FOM/GMRES and variants -- 5. Methods equivalent to FOM or GMRES- 6. Hessenberg/CMRH -- 7. BiCG/QMR and Lanczos algorithms -- 8. Transpose-free Lanczos methods -- 9. The IDR family -- 10. Restart, deflation and truncation -- 11. Related topics -- 12. Numerical comparison of methods -- A. Test matrices and short biographical notices -- References -- Index 
653 |a Numerical Analysis 
653 |a Numerical analysis 
700 1 |a Duintjer Tebbens, Jurjen  |e [author] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Springer Series in Computational Mathematics 
028 5 0 |a 10.1007/978-3-030-55251-0 
856 4 0 |u https://doi.org/10.1007/978-3-030-55251-0?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 518 
520 |a This book aims to give an encyclopedic overview of the state-of-the-art of Krylov subspace iterative methods for solving nonsymmetric systems of algebraic linear equations and to study their mathematical properties. Solving systems of algebraic linear equations is among the most frequent problems in scientific computing; it is used in many disciplines such as physics, engineering, chemistry, biology, and several others. Krylov methods have progressively emerged as the iterative methods with the highest efficiency while being very robust for solving large linear systems; they may be expected to remain so, independent of progress in modern computer-related fields such as parallel and high performance computing.The mathematical properties of the methods are described and analyzed along with their behavior in finite precision arithmetic. A number of numerical examples demonstrate the properties and the behavior of the described methods. Also considered are the methods’ implementations and coding as Matlab®-like functions. Methods which became popular recently are considered in the general framework of Q-OR (quasi-orthogonal )/Q-MR (quasi-minimum) residual methods. This book can be useful for both practitioners and for readers who are more interested in theory. Together with a review of the state-of-the-art, it presents a number of recent theoretical results of the authors, some of them unpublished, as well as a few original algorithms. Some of the derived formulas might be useful for the design of possible new methods or for future analysis. For the more applied user, the book gives an up-to-date overview of the majority of the available Krylov methods for nonsymmetric linear systems, including well-known convergence properties and, as we said above, template codes that can serve as the base for more individualized and elaborate implementations