A relational approach to the compilation of sparse matrix programs

DOI10.1007/BFB0002751MaRDI QIDQ4536949zbMATH OpenFDO

Authors Vladimir Kotlyar, Keshav Pingali, Paul Vinson Stodghill

Publication date 6 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002751

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Applicability of program comprehension to sparse matrix computations
• A study of sparse matrix representations for solving linear systems in a functional language
• Sparse matrix representations in a functional language
• scientific article; zbMATH DE number 4117735
• scientific article; zbMATH DE number 51442
• Effects of Ordering Strategies and Programming Paradigms on Sparse Matrix Computations
• Compile and run-time support for the parallelization of sparse matrix updating algorithms
• scientific article; zbMATH DE number 1070485
• Making sparse matrices sparser: Computational results
• scientific article; zbMATH DE number 3958557

Cited in

(5)

• The automatic generation of sparse primitives
• Applicability of program comprehension to sparse matrix computations
• The Tailoring of Abstract Functional Specifications of Numerical Algorithms for Sparse Data Structures through Automated Program Derivation and Transformation
• Specifying and verifying sparse matrix codes
• A MATLAB-based code generator for sparse matrix computations

Describes a project that uses

Uses Software

• BlockSolve95

This page was built for publication: A relational approach to the compilation of sparse matrix programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536949)