This is a test
- 336 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
eBook - ePub
Sparse Matrix Technology
Book details
Book preview
Table of contents
Citations
About This Book
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.
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Sparse Matrix Technology by Sergio Pissanetzky in PDF and/or ePUB format, as well as other popular books in Mathematics & Algebra. We have over one million books available in our catalogue for you to explore.
Information
CHAPTER 1
Fundamentals
Publisher Summary
This chapter discusses certain computational techniques of sufficiently general use to be considered as fundamentals of sparse matrix technology. The chapter discusses structures and internal representations used for storing lists of numbers, graphs, and various types of sparse matrices and sparse block-partitioned matrices. Symbolic and numerical processing of sparse matrices and dynamic storage allocation are examined. Also, the computational algebra of sparse vectors is discussed, as a row of a sparse matrix is a sparse vector and most of sparse matrix algebra requires that operations be performed with sparse vectors. Sparse matrix technology frequently requires the storage and manipulation of lists of items, where âitemâ may be an integer number, a real or complex number, or an entity having a more complicated structure such as a matrix, an array or a vertex of a graph together with the corresponding edges or branching information. The selection of a storage scheme depends on the operations to be performed, as the effectiveness of a certain operation may vary widely from one storage scheme to another.
1.1 Introduction
In this chapter we discuss certain computational techniques of sufficiently general use to be considered as Fundamentals of Sparse Matrix Technology. The chapter begins with a description of structures and internal representations used for storing lists of numbers, graphs, and various types of sparse matrices and sparse block-partitioned matrices. The aim is to introduce precisely those ideas which are relevant to the subject and to illustrate them with simple examples. Symbolic and numerical processing of sparse matrices and dynamic storage allocation are examined. Finally, the computational algebra of sparse vectors is discussed, since a row of a sparse matrix is a sparse vector and most of sparse matrix algebra requires that operations be performed with sparse vectors.
1.2 Storage of arrays, lists, stacks and queues
Sparse matrix technology frequently requires the storage and manipulation of lists of items, where âitemâ may be an integer number, a real or complex number, or an entity having a more complicated structure such as a matrix, an array or a vertex of a graph together with the corresponding edges or branching information. Examples of operations commonly performed with lists are: adding an item at the end of the list, deleting an item from the end of the list, inserting or deleting an item in the middle or at the beginning of the lis...
Table of contents
- Cover image
- Title page
- Table of Contents
- Copyright
- Preface
- Dedication
- Introduction
- Chapter 1: Fundamentals
- Chapter 2: Linear Algebraic Equations
- Chapter 3: Numerical Errors in Gauss Elimination
- Chapter 4: Ordering for Gauss Elimination: Symmetric Matrices
- Chapter 5: Ordering for Gauss Elimination: General Matrices
- Chapter 6: Sparse Eigenanalysis
- Chapter 7: Sparse Matrix Algebra
- Chapter 8: Connectivity and Nodal Assembly
- Chapter 9: General Purpose Algorithms
- References
- Subject Index