Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math.symbolic.independent

Topic: Symbolic solution of a sparse linear system of equations
Replies: 2   Last Post: Apr 23, 2014 6:34 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 2
Registered: 3/29/14
Symbolic solution of a sparse linear system of equations
Posted: Mar 29, 2014 6:14 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

To fans/experts of symbolic computation:

I have a a sparse, nonsingular, linear system of equations for n = 16 unknowns.

I want to a symbolic solution in an expression as simple as current techniques can achieve. I have used both Mathematica and Maple. The solution expression is identical (good) but very long (undesirable).

I have a few questions:

1. Empirically, Maple returns the solution much faster. Why?

2. Theoretically, what is the complexity in symbolic operations to get the solution expressions? And what is the complexity for the solution to be evaluated?

3. Is there any special method or toolbox to explore sparsity?

Thank you in advance for any constructive suggestions or pointers to related literature!


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.