A Survey of Sparse Matrix Technology
Author | : Ralph A. Willoughby |
Publisher | : |
Total Pages | : |
Release | : 1972 |
Genre | : |
ISBN | : |
Download A Survey of Sparse Matrix Technology Book in PDF, ePub and Kindle
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download A Survey Of Sparse Matrix Technology PDF full book. Access full book title A Survey Of Sparse Matrix Technology.
Author | : Ralph A. Willoughby |
Publisher | : |
Total Pages | : |
Release | : 1972 |
Genre | : |
ISBN | : |
Author | : Sergio Pissanetzky |
Publisher | : |
Total Pages | : 324 |
Release | : 1984 |
Genre | : |
ISBN | : 0976277530 |
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.
Author | : Sergio Pissanetzky |
Publisher | : Academic Press |
Total Pages | : 336 |
Release | : 2014-06-28 |
Genre | : Mathematics |
ISBN | : 1483270408 |
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.
Author | : Yousef Saad |
Publisher | : SIAM |
Total Pages | : 537 |
Release | : 2003-04-01 |
Genre | : Mathematics |
ISBN | : 0898715342 |
Mathematics of Computing -- General.
Author | : D. Rose |
Publisher | : Springer Science & Business Media |
Total Pages | : 215 |
Release | : 2012-12-06 |
Genre | : Science |
ISBN | : 1461586755 |
This book contains papers on sparse matrices and their appli cations which were presented at a Symposium held at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York on September 9-10, 1971. This is a very active field of research since efficient techniques for handling sparse matrix calculations are an important aspect of problem solving. In large scale problems, the feasibility of the calculation depends critically on the efficiency of the underlying sparse matrix algorithms. An important feature of the conference and its proceedings is the cross-fertilization achieved among a broad spectrum of application areas, and among combinatorialists, numerical analysts, and computer scientists. The mathematical, programming, and data management features of these techniques provide a unifying theme which can benefit readers in many fields. The introduction summarizes the major ideas in each paper. These ideas are interspersed with a brief survey of sparse matrix technology. An extensive unified bibliography is provided for the reader interested in more systematic information. The editors wish to thank Robert K. Brayton for his many helpful suggestions as chairman of the organizing committee and Redmond O'Brien for his editorial and audio-visual assistance. We would also like to thank Mrs. Tiyo Asai and Mrs. Joyce Otis for their help during the conference and on the numerous typing jobs for the manuscript. A special thanks goes to William J. Turner for establishing the IBM Research Symposia Series with Plenum Press.
Author | : J. K. Reid |
Publisher | : |
Total Pages | : 28 |
Release | : 1980 |
Genre | : |
ISBN | : |
Author | : Iain S. Duff |
Publisher | : |
Total Pages | : 90 |
Release | : 1976 |
Genre | : Algebra |
ISBN | : |
Author | : I. S. Duff |
Publisher | : Oxford University Press |
Total Pages | : 539 |
Release | : 2017-02-10 |
Genre | : Mathematics |
ISBN | : 0192507516 |
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.
Author | : Richard F. Hartung |
Publisher | : |
Total Pages | : 1316 |
Release | : 1971 |
Genre | : Shells (Engineering) |
ISBN | : |