Many scientific applications require the solution of a vector multiplied by a matrix. Different strategies can be employed for encoding a sparse matrix. Why would storing the matrix as a two dimensional array be inefficient? Compare the "matrix-free" method to the Compressed Row Storage method in terms of memory requirements, compute performance and flexibility.
Answers
Answered by
0
Answer:
Many scientific applications require the solution of a vector multiplied by a matrix. Different strategies can be employed for encoding a sparse matrix. Why would storing the matrix as a two- dimensional array be inefficient? Compare the "matrix-free” method to the Compressed Row Storage method in terms of memory requirements, compute performance and flexibility.
Similar questions