Direct Methods for Sparse Linear Systems

Häftad, Engelska, 2006

967 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2006-09-30
Mått:177 x 251 x 12 mm
Vikt:425 g
Format:Häftad
Språk:Engelska
Serie:Fundamentals of Algorithms
Antal sidor:119
Förlag:Society for Industrial & Applied Mathematics,U.S.
ISBN:9780898716139

Utforska kategorier

Tillämpad matematik inom Naturvetenskap och teknik

Mer om författaren

Timothy A. Davis is an Associate Professor in Computer and Information Science and Engineering at the University of Florida. He is the author of a suite of sparse matrix packages that are widely used in industry, academia, and government research labs, and related articles in SIAM, ACM, and IEEE journals. He is the co-author of a well-used introduction to MATLAB, the MATLAB Primer (Chapman & Hall/CRC Press, 2005). He is a member of the editorial boards of the IEEE Transactions on Parallel and Distributed Systems, and Computational Optimization and Applications.

Recensioner i media

'Everything you wanted to know but never dared to ask about modern direct linear solvers.' Chen Greif, 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, University of California, Santa Barbara

Innehållsförteckning

PrefaceChapter 1: IntroductionChapter 2: Basic algorithmsChapter 3: Solving triangular systemsChapter 4: Cholesky factorizationChapter 5: Orthogonal methodsChapter 6: LU factorizationChapter 7: Fill-reducing orderingsChapter 8: Solving sparse linear systemsChapter 9: CSparseChapter 10: Sparse matrices in MATLABAppendix: Basics of the C programming languageBibliographyIndex.