Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #2102
| Path | csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!news-out.readnews.com!transit3.readnews.com!newspump.sol.net!posts.news.twtelecom.net!nnrp3.twtelecom.net!not-for-mail |
|---|---|
| From | dantimatter <google@dantimatter.com> |
| Newsgroups | comp.soft-sys.math.mathematica |
| Subject | Re: anything faster than Solve[] for solving sets of polynomial equations symbolically? |
| Date | Wed, 4 May 2011 23:47:40 +0000 (UTC) |
| Organization | Steven M. Christensen and Associates, Inc and MathTensor, Inc. |
| Sender | steve@smc.vnet.net |
| Approved | Steven M. Christensen <steve@smc.vnet.net>, Moderator |
| Message-ID | <ipsois$8b6$1@smc.vnet.net> (permalink) |
| Lines | 8 |
| NNTP-Posting-Date | 04 May 2011 22:48:30 GMT |
| NNTP-Posting-Host | dd96ef00.news.twtelecom.net |
| X-Trace | DXC=Nk^[:^i[67VaZ\a6[n:\J_C_A=>8kQj6]Y;@_o827nGS^01nm;E34APEFiONJ7[GoVb]Lfjf=U[O[ |
| X-Complaints-To | abuse@twtelecom.net |
| Xref | x330-a1.tempe.blueboxinc.net comp.soft-sys.math.mathematica:2102 |
Show key headers only | View raw
Hi David, Thanks for the response! It seems that my problem takes a really long time only when I try to incorporate all the 'k_i >= 0' right into Solve[]. When I leave those inequalities out, and then use Assuming[] as you've suggested, things go much faster. Cheers, Dan
Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread
Re: anything faster than Solve[] for solving sets of polynomial equations symbolically? dantimatter <google@dantimatter.com> - 2011-05-04 23:47 +0000
csiph-web