Abstract

Matrix is a mathematical object, commonly used in scientific computing and engineering calculation. In the data structure we are not interested in data itself, but how to store the elements in the matrix, and make the various operations can run effectively. The main purpose of the compressed storage is to make more of the same nonzero elements share the same storage unit according to the distribution of matrix element, while the zero elements don't allocate storage space. In this paper, we studied the compressed storage problems of lower half banded matrix, and obtained the corresponding storage address mapping function, so as to help the scientific research worker.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.