Abstract
In many practical problems matrices become extremely large. So their representations grow up to data structure problems. It is necessary to arrange their elements and substructures for effective data processing. A method for eliminating redundancy is presented which is best suited for large, e. g. sparse matrices. A matrix description language, given inBackus normal form, is chosen which fits to the data structure of the method proposed.
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 callDisclaimer: 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.
