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.

Issues in Algebra, Geometry, and Topology / 2011 Edition is a ScholarlyEditions™ eBook that delivers timely, authoritative, and comprehensive information about Algebra, Geometry, and Topology. The editors have built Issues in Algebra, Geometry, and Topology: 2011 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Algebra, Geometry, and Topology in this eBook to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in Algebra, Geometry, and Topology: 2011 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

Table of contents

An undergraduate textbook that highlights motivating applications and contains summary sections, examples, exercises, online MATLAB codes and a MATLAB toolkit. All the major topics of computational linear algebra are covered, from basic concepts to advanced topics such as the quadratic eigenvalue problem in later chapters.

Acta Numerica is an annual volume presenting survey papers in numerical analysis. Each year the editorial board selects significant topics and invites papers from authors who have made notable contributions to the development of that topic. The articles are intended to summarize the field at a level accessible to graduate students and researchers. Acta Numerica is a valuable tool not only for researchers and professionals wishing to develop their understanding of the subject and follow developments, but also as an advanced teaching aid at colleges and universities. This volume was originally published in 1992.

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 explained and derived in a concise and unified way. Furthermore, some Krylov subspace methods in the twenty-first century are described in detail, such as the COCR method for complex symmetric linear systems, the BiCR method, and the IDR(s) method for non-Hermitian linear systems. The strength of the book is not only in describing principles of Krylov subspace methods but in providing a variety of applications: shifted linear systems and matrix functions from the theoretical point of view, as well as partial differential equations, computational physics, computational particle physics, optimizations, and machine learning from a practical point of view. The book is self-contained in that basic necessary concepts of numerical linear algebra are explained, making it suitable for senior undergraduates, postgraduates, and researchers in mathematics, engineering, and computational science. Readers will find it a useful resource for understanding the principles and properties of Krylov subspace methods and correctly using those methods for solving problems in the future.

This expansive volume describes the history of numerical methods proposed for solving linear algebra problems, from antiquity to the present day. The authors focus on methods for linear systems of equations and eigenvalue problems and describe the interplay between numerical methods and the computing tools available at the time. The second part of the book consists of 78 biographies of important contributors to the field. A Journey through the History of Numerical Linear Algebra will be of special interest to applied mathematicians, especially researchers in numerical linear algebra, people involved in scientific computing, and historians of mathematics.

Part of a four-volume set, this book constitutes the refereed proceedings of the 7th International Conference on Computational Science, ICCS 2007, held in Beijing, China in May 2007. The papers cover a large volume of topics in computational science and related areas, from multiscale physics to wireless networks, and from graph theory to tools for program development.

The first four chapters of this book give a comprehensive and unified theory of the Krylov methods. Many of these are shown to be particular examples ofthe block conjugate-gradient algorithm and it is this observation thatpermits the unification of the theory. The two major sub-classes of thosemethods, the Lanczos and the Hestenes-Stiefel, are developed in parallel asnatural generalisations of the Orthodir (GCR) and Orthomin algorithms. Theseare themselves based on Arnoldi's algorithm and a generalised Gram-Schmidtalgorithm and their properties, in particular their stability properties,are determined by the two matrices that define the block conjugate-gradientalgorithm. These are the matrix of coefficients and the preconditioningmatrix.In Chapter 5 the"transpose-free" algorithms based on the conjugate-gradient squared algorithm are presented while Chapter 6 examines the various ways in which the QMR technique has been exploited. Look-ahead methods and general block methods are dealt with in Chapters 7 and 8 while Chapter 9 is devoted to error analysis of two basic algorithms.In Chapter 10 the results of numerical testing of the more important algorithms in their basic forms (i.e. without look-ahead or preconditioning) are presented and these are related to the structure of the algorithms and the general theory. Graphs illustrating the performances of various algorithm/problem combinations are given via a CD-ROM.Chapter 11, by far the longest, gives a survey of preconditioning techniques. These range from the old idea of polynomial preconditioning via SOR and ILU preconditioning to methods like SpAI, AInv and the multigrid methods that were developed specifically for use with parallel computers. Chapter 12 is devoted to dual algorithms like Orthores and the reverse algorithms of Hegedus. Finally certain ancillary matters like reduction to Hessenberg form, Chebychev polynomials and the companion matrix are described in a series of appendices.·comprehensive and unified approach·up-to-date chapter on preconditioners·complete theory of stability·includes dual and reverse methods·comparison of algorithms on CD-ROM·objective assessment of algorithms

The 5th edition of the VECPAR series of conferences marked a change of the conference title. The full conference title now reads VECPAR 2002 — 5th Int- national Conference on High Performance Computing for Computational S- ence. This re?ects more accurately what has been the main emphasis of the conference since its early days in 1993 – the use of computers for solving pr- lems in science and engineering. The present postconference book includes the best papers and invited talks presented during the three days of the conference, held at the Faculty of Engineering of the University of Porto (Portugal), June 26–28 2002. The book is organized into 8 chapters, which as a whole appeal to a wide research community, from those involved in the engineering applications to those interested in the actual details of the hardware or software implementation, in line with what, in these days, tends to be considered as Computational Science and Engineering (CSE). The book comprises a total of 49 papers, with a prominent position reserved for the four invited talks and the two ?rst prizes of the best student paper competition.