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

Download Direct Methods for Sparse Linear Systems Book in PDF, Epub and Kindle

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.

Direct Methods for Sparse Matrices

Direct Methods for Sparse Matrices
Author: I. S. Duff
Publisher: Oxford University Press
Total Pages: 416
Release: 2017-02-10
Genre: Mathematics
ISBN: 0192507516

Download Direct Methods for Sparse Matrices Book in PDF, Epub and Kindle

The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This second edition is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all examples in the first edition were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done in the last 30 years, some of it by the authors themselves. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems.

Direct Methods for Sparse Linear Systems

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

Download Direct Methods for Sparse Linear Systems Book in PDF, Epub and Kindle

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.

Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Author: Yousef Saad
Publisher: SIAM
Total Pages: 537
Release: 2003-04-01
Genre: Mathematics
ISBN: 0898715342

Download Iterative Methods for Sparse Linear Systems Book in PDF, Epub and Kindle

Mathematics of Computing -- General.

Direct Methods for Sparse Matrices

Direct Methods for Sparse Matrices
Author: O. Osterby
Publisher: Lecture Notes in Computer Science
Total Pages: 142
Release: 1983-08
Genre: Mathematics
ISBN:

Download Direct Methods for Sparse Matrices Book in PDF, Epub and Kindle

Sparse Matrix Technology

Sparse Matrix Technology
Author: Sergio Pissanetzky
Publisher: Academic Press
Total Pages: 336
Release: 2014-06-28
Genre: Mathematics
ISBN: 1483270408

Download Sparse Matrix Technology Book in PDF, Epub and Kindle

Sparse Matrix Technology presents the methods, concepts, ideas, and applications of sparse matrix technology. The text provides the fundamental methods, procedures, techniques, and applications of sparse matrix technology in software development. The book covers topics on storage schemes and computational techniques needed for sparse matrix technology; sparse matrix methods and algorithms for the direct solution of linear equations; and algorithms for different purposes connected with sparse matrix technology. Engineers, programmers, analysts, teachers, and students in the computer sciences will find the book interesting.

Direct methods for sparse matrices

Direct methods for sparse matrices
Author: Aarhus Universitet. Regionale EDB-center. Centre for Basic Research in Computer Science
Publisher:
Total Pages: 128
Release: 1980
Genre: Sparse matrices
ISBN:

Download Direct methods for sparse matrices Book in PDF, Epub and Kindle

Sparse Matrix Computations

Sparse Matrix Computations
Author: James R. Bunch
Publisher: Academic Press
Total Pages: 468
Release: 2014-05-10
Genre: Mathematics
ISBN: 1483263401

Download Sparse Matrix Computations Book in PDF, Epub and Kindle

Sparse Matrix Computations is a collection of papers presented at the 1975 Symposium by the same title, held at Argonne National Laboratory. This book is composed of six parts encompassing 27 chapters that contain contributions in several areas of matrix computations and some of the most potential research in numerical linear algebra. The papers are organized into general categories that deal, respectively, with sparse elimination, sparse eigenvalue calculations, optimization, mathematical software for sparse matrix computations, partial differential equations, and applications involving sparse matrix technology. This text presents research on applied numerical analysis but with considerable influence from computer science. In particular, most of the papers deal with the design, analysis, implementation, and application of computer algorithms. Such an emphasis includes the establishment of space and time complexity bounds and to understand the algorithms and the computing environment. This book will prove useful to mathematicians and computer scientists.

Fast Direct Solvers for Elliptic PDEs

Fast Direct Solvers for Elliptic PDEs
Author: Per-Gunnar Martinsson
Publisher: SIAM
Total Pages: 332
Release: 2019-12-16
Genre: Mathematics
ISBN: 1611976049

Download Fast Direct Solvers for Elliptic PDEs Book in PDF, Epub and Kindle

Fast solvers for elliptic PDEs form a pillar of scientific computing. They enable detailed and accurate simulations of electromagnetic fields, fluid flows, biochemical processes, and much more. This textbook provides an introduction to fast solvers from the point of view of integral equation formulations, which lead to unparalleled accuracy and speed in many applications. The focus is on fast algorithms for handling dense matrices that arise in the discretization of integral operators, such as the fast multipole method and fast direct solvers. While the emphasis is on techniques for dense matrices, the text also describes how similar techniques give rise to linear complexity algorithms for computing the inverse or the LU factorization of a sparse matrix resulting from the direct discretization of an elliptic PDE. This is the first textbook to detail the active field of fast direct solvers, introducing readers to modern linear algebraic techniques for accelerating computations, such as randomized algorithms, interpolative decompositions, and data-sparse hierarchical matrix representations. Written with an emphasis on mathematical intuition rather than theoretical details, it is richly illustrated and provides pseudocode for all key techniques. Fast Direct Solvers for Elliptic PDEs is appropriate for graduate students in applied mathematics and scientific computing, engineers and scientists looking for an accessible introduction to integral equation methods and fast solvers, and researchers in computational mathematics who want to quickly catch up on recent advances in randomized algorithms and techniques for working with data-sparse matrices.