Automatic Nonzero Structure Analysis

The efficiency of sparse codes heavily depends on the size and structure of the input data. Peculiarities of the nonzero structure of each sparse matrix must be accounted for to avoid unsatisfying performance. Therefore, it is important to have an efficient analyzer that automatically determines characteristics of nonzero structures. In this paper, some efficient algorithms are presented that automatically detect particular nonzero structures.

[1]  Elizabeth Cuthill,et al.  Several Strategies for Reducing the Bandwidth of Matrices , 1972 .

[2]  I. Duff.  A survey of sparse matrix research , 1977, Proceedings of the IEEE.

[3]  Thomas F. Coleman,et al.  Large Sparse Numerical Optimization , 1984, Lecture Notes in Computer Science.

[4]  Alan George,et al.  An Implementation of a Pseudoperipheral Node Finder , 1979, TOMS.

[5]  Jack J. Dongarra,et al.  Solving linear systems on vector and shared memory computers , 1990 .

[6]  Aart J. C. Bik,et al.  Nonzero structure analysis , 1994, ICS '94.

[7]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[8]  Aart J. C. Bik,et al.  The Use of Iteration Space Partitioning to Construct Representative Simple Sections , 1996, J. Parallel Distributed Comput..

[9]  Wai-Mee Ching,et al.  Sparse matrix technology tools in APL , 1990 .

[10]  K. D. Ikramov.  Sparse matrices , 2020, Krylov Subspace Methods with Application in Incompressible Fluid Flow Solvers.

[11]  Z. Zlatev.  Computational Methods for General Sparse Matrices , 1991 .

[12]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[13]  Aart J. C. Bik,et al.  Advanced Compiler Optimizations for Sparse Computations , 1995, J. Parallel Distributed Comput..

[14]  R. A. Walt,et al.  The numerical solution of algebraic equations , 1979 .

[15]  Reginald P. Tewarson.  Sorting and ordering sparse linear systems , 1970 .

[16]  William H. Press,et al.  Numerical recipes , 1990 .

[17]  Aart J. C. Bik,et al.  Automatic Data Structure Selection and Transformation for Sparse Matrix Computations , 1996, IEEE Trans. Parallel Distributed Syst..

[18]  Marinus Veldhorst,et al.  An analysis of sparse matrix storage schemes , 1982 .

[19]  Aart J. C. Bik,et al.  Compiler support for sparse matrix computations , 1996 .

[20]  Iain S. Duff,et al.  Sparse matrix test problems , 1982 .

[21]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.