2013-09-18 07:25:26 +0200 | received badge | ● Editor (source) |

2013-09-18 06:19:53 +0200 | received badge | ● Student (source) |

2013-09-17 01:08:35 +0200 | asked a question | Sparse morphism versus sparse matrix I would like to use VectorSpaceMorphism when the underlying domain, codomain and matrix are sparse. However, the morphism seems to convert everything to dense. The following is from Sage 5.9. V.hom doesn't take the keyword 'sparse'. Let v be a vector in V, which is sparse. Tests with pdb show that when we call f(v), it converts v to dense behind the scenes, multiplies by the dense matrix, and converts the dense vector result back to sparse. Of course this is slow. The more fundamental issue is that, in some of my applications, A will be too large to store densely. |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.