Premium
A practical solution for a large sparse matrix
Author(s) -
Hentzel I. R.,
Pokrass D. J.
Publication year - 1988
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380180307
Subject(s) - matrix (chemical analysis) , simple (philosophy) , sparse matrix , computer science , matrix free methods , integer matrix , integer (computer science) , algorithm , theoretical computer science , mathematical optimization , algebra over a field , computational science , mathematics , symmetric matrix , nonnegative matrix , pure mathematics , programming language , philosophy , materials science , physics , eigenvalues and eigenvectors , epistemology , quantum mechanics , composite material , gaussian
This paper describes a computational technique that was used for determining whether a certain matrix equation, Mx = b, had an exact solution. Here, M T was a sparse 96,208 × 40,040 integer matrix. The approach is an appropriate alternative for certain matrices when memory constraints preclude using conventional techniques. The tools used are simple and their data structures well‐suited for virtual memory computers. An important aspect of the method is to adopt different data structures to represent the matrix as the matrix changes over the course of the problem.