Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Sparse Matrix Package—Part II: Special Cases

A Sparse Matrix Package—Part II: Special Cases A Sparse Matrix Package Part I1" Special Cases J. M. McNAMEE York University, Canada A set of subroutines is described for combining pmrs of sparse matrices in special cases m which one of the matrices may be regarded as full, and/or a vector, and/or an elementary matrLx. Tests show that in many cases the new routines are faster than an earlier set of more general-purpose routines. Also, a new (faster) routine is given for multiplying two sparse matrices. Categories and Subject Descriptors: G.1.3 [Numerical Analysis]: Numerical Linear Algebra--sparse and very large systems General Terms" Algorithms Additional Key Words and Phrases: Matrix, sparse matrix, matrix manipulation The Algorithm: A Sparse Matrix Package--Part II: Special Cases. ACM Trans. Math. Soflw. 9, 3 (Sept. 1983), 344-345. 1. INTRODUCTION I n [4] a s e t of s u b r o u t i n e s w a s g i v e n for v a r i o u s o p e r a t i o n s o n s p a r s e m a t r i c e s , s u c h as a d d i t i http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Mathematical Software (TOMS) Association for Computing Machinery

A Sparse Matrix Package—Part II: Special Cases

Download PDF
4 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-sparse-matrix-package-part-ii-special-cases-QfJSZr2yKz

References (9)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1983 by ACM Inc.
ISSN
0098-3500
DOI
10.1145/356044.356049
Publisher site
See Article on Publisher Site

Abstract

A Sparse Matrix Package Part I1" Special Cases J. M. McNAMEE York University, Canada A set of subroutines is described for combining pmrs of sparse matrices in special cases m which one of the matrices may be regarded as full, and/or a vector, and/or an elementary matrLx. Tests show that in many cases the new routines are faster than an earlier set of more general-purpose routines. Also, a new (faster) routine is given for multiplying two sparse matrices. Categories and Subject Descriptors: G.1.3 [Numerical Analysis]: Numerical Linear Algebra--sparse and very large systems General Terms" Algorithms Additional Key Words and Phrases: Matrix, sparse matrix, matrix manipulation The Algorithm: A Sparse Matrix Package--Part II: Special Cases. ACM Trans. Math. Soflw. 9, 3 (Sept. 1983), 344-345. 1. INTRODUCTION I n [4] a s e t of s u b r o u t i n e s w a s g i v e n for v a r i o u s o p e r a t i o n s o n s p a r s e m a t r i c e s , s u c h as a d d i t i

Journal

ACM Transactions on Mathematical Software (TOMS) – Association for Computing Machinery

Published: Sep 1, 1983

There are no references for this article.