Sparse Matrix Technology - electronic edition
Author : Sergio Pissanetzky
Publisher :
Page : 324 pages
File Size : 34,33 MB
Release : 1984
Category :
ISBN : 0976277530
Author : Sergio Pissanetzky
Publisher :
Page : 324 pages
File Size : 34,33 MB
Release : 1984
Category :
ISBN : 0976277530
Author : Sergio Pissanetzky
Publisher : Academic Press
Page : 336 pages
File Size : 25,27 MB
Release : 2014-06-28
Category : 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
Page : 537 pages
File Size : 27,18 MB
Release : 2003-04-01
Category : Mathematics
ISBN : 0898715342
Mathematics of Computing -- General.
Author : Timothy A. Davis
Publisher : SIAM
Page : 228 pages
File Size : 14,5 MB
Release : 2006-09-01
Category : 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 : James R. Bunch
Publisher : Academic Press
Page : 468 pages
File Size : 26,98 MB
Release : 2014-05-10
Category : Mathematics
ISBN : 1483263401
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.
Author : I. S. Duff
Publisher : Oxford University Press
Page : 539 pages
File Size : 18,62 MB
Release : 2017-02-10
Category : 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 : Thierry Bouwmans
Publisher : CRC Press
Page : 553 pages
File Size : 44,20 MB
Release : 2016-05-27
Category : Computers
ISBN : 1498724639
Handbook of Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing shows you how robust subspace learning and tracking by decomposition into low-rank and sparse matrices provide a suitable framework for computer vision applications. Incorporating both existing and new ideas, the book conveniently gives you one-stop access to a number of different decompositions, algorithms, implementations, and benchmarking techniques. Divided into five parts, the book begins with an overall introduction to robust principal component analysis (PCA) via decomposition into low-rank and sparse matrices. The second part addresses robust matrix factorization/completion problems while the third part focuses on robust online subspace estimation, learning, and tracking. Covering applications in image and video processing, the fourth part discusses image analysis, image denoising, motion saliency detection, video coding, key frame extraction, and hyperspectral video processing. The final part presents resources and applications in background/foreground separation for video surveillance. With contributions from leading teams around the world, this handbook provides a complete overview of the concepts, theories, algorithms, and applications related to robust low-rank and sparse matrix decompositions. It is designed for researchers, developers, and graduate students in computer vision, image and video processing, real-time architecture, machine learning, and data mining.
Author : Yousef Saad
Publisher : SIAM
Page : 292 pages
File Size : 34,77 MB
Release : 2011-01-01
Category : Mathematics
ISBN : 9781611970739
This revised edition discusses numerical methods for computing eigenvalues and eigenvectors of large sparse matrices. It provides an in-depth view of the numerical methods that are applicable for solving matrix eigenvalue problems that arise in various engineering and scientific applications. Each chapter was updated by shortening or deleting outdated topics, adding topics of more recent interest, and adapting the Notes and References section. Significant changes have been made to Chapters 6 through 8, which describe algorithms and their implementations and now include topics such as the implicit restart techniques, the Jacobi-Davidson method, and automatic multilevel substructuring.
Author : Ronald F. Boisvert
Publisher : Springer
Page : 386 pages
File Size : 38,49 MB
Release : 2016-01-09
Category : Computers
ISBN : 1504129407
Numerical software is central to our computerized society. It is used to control aeroplanes and bridges, operate manufacturing lines, control power plants and refineries, and analyse financial markets. Such software must be accurate, reliable, robust, efficient, easy to use, maintainable and adaptable. Quality assessment and control of numerical software is still not well understood. Although measurement is a key element, it remains difficult to assess many components of software quality and to evaluate the trade-offs between them. Fortunately, as numerical software is built upon a long established foundation of mathematical and computational knowledge, there is great potential for dramatic breakthroughs. This volume will address enabling techniques and tools such as benchmarks, testing methodologies, quality standards, metrics, and accuracy control mechanisms, and their application to software for differential equations, linear algebra, data analysis, as well as the evaluation of integrals, derivatives and elementary and special functions.
Author : Duc Thai Nguyen
Publisher : Springer Science & Business Media
Page : 545 pages
File Size : 11,31 MB
Release : 2006-07-18
Category : Technology & Engineering
ISBN : 0387308512
Finite element methods (FEM), and its associated computer software have been widely accepted as one of the most effective general tools for solving large-scale, practical engineering and science applications. For implicit finite element codes, it is a well-known fact that efficient equation and eigen-solvers play critical roles in solving large-scale, practical engineering/science problems. Sparse matrix technologies have been evolved and become mature enough that all popular, commercialized FEM codes have already inserted sparse solvers into their software. However, a few FEM books have detailed discussions about Lanczos eigen-solvers, or explain domain decomposition (DD) finite element formulation (including detailed hand-calculator numerical examples) for parallel computing purposes. The materials from this book have been evolved over the past several years through the author's research work, and graduate courses.