Forums before death by AOL, social media and spammers... "We can't have nice things"
|    sci.math.symbolic    |    Symbolic algebra discussion    |    10,432 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 8,577 of 10,432    |
|    nikos.p.pitsianis@gmail.com to Roman Pearce    |
|    Re: Symbolic solution of a sparse linear    |
|    23 Apr 14 15:34:03    |
      On Saturday, April 12, 2014 7:22:21 PM UTC-4, Roman Pearce wrote:       > I can tell you what Maple does, but can you post your system? Maple's       linear solver attempts to preserve sparsity and control size during pivot       selection. For symbolic linear systems, it will do a lot of arithmetic with       polynomials and rational        functions. Maple is highly optimized for that. Theoretically, it is not       practical in most cases to symbolically solve linear systems and then evaluate       the solution. In fact, a fast way to solve the system symbolically is to       repeatedly plug in numbers        and solve numerically, and then interpolate :)              Thank you for your reply.              I will provide the linear system.              Generally speaking, I am assuming that solving an nxn linear system       symbolically has exponential complexity on n, right?              Nikos              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca