On Jun 3, 10:03 am, John H Palmieri <[email protected]> wrote: > As far as I understand it, there are two approaches to linear algebra in > Sage: the one you describe, and then "CombinatorialFreeModule". The latter > is good for working with the vector space spanned by symbols 'u', 'v', and > 'w', for example, or the vector space spanned by all partitions of 35, or > all permutations of [1,2,3,4], or all simplices in some simplicial complex, > and as such it is good for constructing algebras and modules.
Thanks for pointing out its existence. Are you sure it really supports linear *algebra* though? It seems to support basic arithmetic, but operations like finding kernels and linear subspaces do not seem to be directly supported. There is module_morphism (why not hom?), but that does not have anything non-trivial implemented on it. As such, it its present form it seems to mainly form a framework for possibly convenient translation between different categories of objects (i.e., a kind of "coercion hub") rather than something that is good for nontrivial computations by itself. If I'm missing something from the docs I'm happy to be corrected. It looks like some of this could possibly be useful for working with graded parts of quotients of polynomial rings by homogeneous polynomials. -- To post to this group, send an email to [email protected] To unsubscribe from this group, send an email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
