๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Direct Methods for Sparse Linear Systems

โœ Scribed by Timothy A. Davis


Publisher
Society for Industrial Mathematics
Year
2006
Tongue
English
Leaves
230
Series
Fundamentals of Algorithms
Edition
illustrated edition
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Fundamentals of Algorithms 2 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. 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. "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.

โœฆ Subjects


ะœะฐั‚ะตะผะฐั‚ะธะบะฐ;ะ’ั‹ั‡ะธัะปะธั‚ะตะปัŒะฝะฐั ะผะฐั‚ะตะผะฐั‚ะธะบะฐ;ะ’ั‹ั‡ะธัะปะธั‚ะตะปัŒะฝั‹ะต ะผะตั‚ะพะดั‹ ะปะธะฝะตะนะฝะพะน ะฐะปะณะตะฑั€ั‹;


๐Ÿ“œ SIMILAR VOLUMES


Direct Methods for Sparse Linear Systems
โœ Timothy A. Davis ๐Ÿ“‚ Library ๐Ÿ“… 2006 ๐Ÿ› Society for Industrial and Applied Mathematic ๐ŸŒ English

This books provides a decent library of sparse matrix functions. However, it can be difficult to understand the code at times because the author chose to use cryptic variable names.

Iterative methods for sparse linear syst
โœ Yousef Saad ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English

This book can be used to teach graduate-level courses on iterative methods for linear systems. Engineers and mathematicians will find its contents easily accessible, and practitioners and educators will value it as a helpful resource. The preface includes syllabi that can be used for either a semest