Direct Methods for Sparse Linear Systems

Direct Methods for Sparse Linear Systems
Author: Timothy A. Davis
Publisher: SIAM
Total Pages: 228
Release: 2006-09-01
Genre: Computers
ISBN: 0898716136

The sparse backslash book. Everything you wanted to know but never dared to ask about modern direct linear solvers. Chen Greif, Assistant Professor, Department of Computer Science, University of British Columbia.Overall, the book is magnificent. It fills a long-felt need for an accessible textbook on modern sparse direct methods. Its choice of scope is excellent John Gilbert, Professor, Department of Computer Science, University of California, Santa Barbara.Computational scientists often encounter problems requiring the solution of sparse systems of linear equations. Attacking these problems efficiently requires an in-depth knowledge of the underlying theory, algorithms, and data structures found in sparse matrix software libraries. Here, Davis presents the fundamentals of sparse matrix algorithms to provide the requisite background. The book includes CSparse, a concise downloadable sparse matrix package that illustrates the algorithms and theorems presented in the book and equips readers with the tools necessary to understand larger and more complex software packages.With a strong emphasis on MATLAB and the C programming language, Direct Methods for Sparse Linear Systems equips readers with the working knowledge required to use sparse solver packages and write code to interface applications to those packages. The book also explains how MATLAB performs its sparse matrix computations.Audience This invaluable book is essential to computational scientists and software developers who want to understand the theory and algorithms behind modern techniques used to solve large sparse linear systems. The book also serves as an excellent practical resource for students with an interest in combinatorial scientific computing.Preface; Chapter 1: Introduction; Chapter 2: Basic algorithms; Chapter 3: Solving triangular systems; Chapter 4: Cholesky factorization; Chapter 5: Orthogonal methods; Chapter 6: LU factorization; Chapter 7: Fill-reducing orderings; Chapter 8: Solving sparse linear systems; Chapter 9: CSparse; Chapter 10: Sparse matrices in MATLAB; Appendix: Basics of the C programming language; Bibliography; Index.

Coding the Matrix

Coding the Matrix
Author: Philip N. Klein
Publisher:
Total Pages: 530
Release: 2013-07
Genre: Algebras, Linear
ISBN: 9780615856735

An engaging introduction to vectors and matrices and the algorithms that operate on them, intended for the student who knows how to program. Mathematical concepts and computational problems are motivated by applications in computer science. The reader learns by "doing," writing programs to implement the mathematical concepts and using them to carry out tasks and explore the applications. Examples include: error-correcting codes, transformations in graphics, face detection, encryption and secret-sharing, integer factoring, removing perspective from an image, PageRank (Google's ranking algorithm), and cancer detection from cell features. A companion web site, codingthematrix.com provides data and support code. Most of the assignments can be auto-graded online. Over two hundred illustrations, including a selection of relevant "xkcd" comics. Chapters: "The Function," "The Field," "The Vector," "The Vector Space," "The Matrix," "The Basis," "Dimension," "Gaussian Elimination," "The Inner Product," "Special Bases," "The Singular Value Decomposition," "The Eigenvector," "The Linear Program" A new edition of this text, incorporating corrections and an expanded index, has been issued as of September 4, 2013, and will soon be available on Amazon.

Templates for the Solution of Linear Systems

Templates for the Solution of Linear Systems
Author: Richard Barrett
Publisher: SIAM
Total Pages: 141
Release: 1994-01-01
Genre: Mathematics
ISBN: 9781611971538

In this book, which focuses on the use of iterative methods for solving large sparse systems of linear equations, templates are introduced to meet the needs of both the traditional user and the high-performance specialist. Templates, a description of a general algorithm rather than the executable object or source code more commonly found in a conventional software library, offer whatever degree of customization the user may desire. Templates offer three distinct advantages: they are general and reusable; they are not language specific; and they exploit the expertise of both the numerical analyst, who creates a template reflecting in-depth knowledge of a specific numerical technique, and the computational scientist, who then provides "value-added" capability to the general template description, customizing it for specific needs. For each template that is presented, the authors provide: a mathematical description of the flow of algorithm; discussion of convergence and stopping criteria to use in the iteration; suggestions for applying a method to special matrix types; advice for tuning the template; tips on parallel implementations; and hints as to when and why a method is useful.

Handbook of Geomathematics

Handbook of Geomathematics
Author: Willi Freeden
Publisher: Springer Science & Business Media
Total Pages: 1371
Release: 2010-08-13
Genre: Mathematics
ISBN: 364201545X

During the last three decades geosciences and geo-engineering were influenced by two essential scenarios: First, the technological progress has changed completely the observational and measurement techniques. Modern high speed computers and satellite based techniques are entering more and more all geodisciplines. Second, there is a growing public concern about the future of our planet, its climate, its environment, and about an expected shortage of natural resources. Obviously, both aspects, viz. efficient strategies of protection against threats of a changing Earth and the exceptional situation of getting terrestrial, airborne as well as spaceborne data of better and better quality explain the strong need of new mathematical structures, tools, and methods. Mathematics concerned with geoscientific problems, i.e., Geomathematics, is becoming increasingly important. The ‘Handbook Geomathematics’ as a central reference work in this area comprises the following scientific fields: (I) observational and measurement key technologies (II) modelling of the system Earth (geosphere, cryosphere, hydrosphere, atmosphere, biosphere) (III) analytic, algebraic, and operator-theoretic methods (IV) statistical and stochastic methods (V) computational and numerical analysis methods (VI) historical background and future perspectives.

Iterative Methods and Preconditioners for Systems of Linear Equations

Iterative Methods and Preconditioners for Systems of Linear Equations
Author: Gabriele Ciaramella
Publisher: SIAM
Total Pages: 285
Release: 2022-02-08
Genre: Mathematics
ISBN: 1611976901

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.

Automatic Differentiation: Applications, Theory, and Implementations

Automatic Differentiation: Applications, Theory, and Implementations
Author: H. Martin Bücker
Publisher: Springer Science & Business Media
Total Pages: 370
Release: 2006-02-03
Genre: Computers
ISBN: 3540284389

Covers the state of the art in automatic differentiation theory and practice. Intended for computational scientists and engineers, this book aims to provide insight into effective strategies for using automatic differentiation for design optimization, sensitivity analysis, and uncertainty quantification.

Sparsity Methods for Systems and Control

Sparsity Methods for Systems and Control
Author: Masaaki Nagahara
Publisher:
Total Pages: 220
Release: 2020-09-30
Genre:
ISBN: 9781680837247

The method of sparsity has been attracting a lot of attention in the fields related not only to signal processing, machine learning, and statistics, but also systems and control. The method is known as compressed sensing, compressive sampling, sparse representation, or sparse modeling. More recently, the sparsity method has been applied to systems and control to design resource-aware control systems. This book gives a comprehensive guide to sparsity methods for systems and control, from standard sparsity methods in finite-dimensional vector spaces (Part I) to optimal control methods in infinite-dimensional function spaces (Part II). The primary objective of this book is to show how to use sparsity methods for several engineering problems. For this, the author provides MATLAB programs by which the reader can try sparsity methods for themselves. Readers will obtain a deep understanding of sparsity methods by running these MATLAB programs. Sparsity Methods for Systems and Control is suitable for graduate level university courses, though it should also be comprehendible to undergraduate students who have a basic knowledge of linear algebra and elementary calculus. Also, especially part II of the book should appeal to professional researchers and engineers who are interested in applying sparsity methods to systems and control.