Applicability of program comprehension to sparse matrix computations

DOI10.1007/BFB0002755MaRDI QIDQ4536954zbMATH OpenFDO

Authors Christoph W. Keßler

Publication date 25 June 2002

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

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

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Theory of software (68N99) Data structures (68P05) Computing methodologies and applications (68U99)

Recommendations

• Toward an automatic parallelization of sparse matrix computations
• Compile and run-time support for the parallelization of sparse matrix updating algorithms
• A relational approach to the compilation of sparse matrix programs
• scientific article; zbMATH DE number 1973865
• scientific article; zbMATH DE number 1862262

Cited in

(4)

• A relational approach to the compilation of sparse matrix programs
• Sparse matrix representations in a functional language
• Sparse computation with PEI
• Toward an automatic parallelization of sparse matrix computations

This page was built for publication: Applicability of program comprehension to sparse matrix computations

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