A transposition algorithm for the factorizable sparse matrix

MaRDI QIDQ4926913zbMATH OpenFDO

Authors Yang Tan, Zhaoyi Tang, Huiyun Quan

Publication date 20 June 2013

zbMATH Keywords

sparse matrixspace complexitytime complexitycompressed storage

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• A general transposition method for a matrix on auxiliary store
• A practical method for compressing sparse matrices with variant entries
• A spectral algorithm for envelope reduction of sparse matrices
• An optimal storage format for sparse matrices
• An algorithm for profile and wavefront reduction of sparse matrices

Cited in

(1)

• scientific article; zbMATH DE number 4126564 (Why is no real title available?)

This page was built for publication: A transposition algorithm for the factorizable sparse matrix

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