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,654 of 10,432    |
|    IV to Richard Fateman    |
|    Re: Algorithm for symbolic solving of Re    |
|    28 Aug 14 23:11:13    |
      XPost: sci.math       From: ivgroups@onlinehome.de              "Richard Fateman" wrote in news:ltg6uo$28p$1@speranza.aioe.org...       >>> No.       >> How we do it by hand: If we use the inverse operation (inverse function)       >> of the outer function in each step. (The roots of algebraic functions       >> can be determined numerically or symbolically - e.g. by the Buchberger       >> algorithm.)       >> How is that realized in computer algebra systems, and how       >> powerful/complete are this methods/algorithms?       > How does your method work for solving for x in exp(x)=log(x) ?       With LambertW.       I see, the inverse function of a Real Elementary function somehow composed       from the Real Elementary Standard functions is not necessarily an Elementary       function.       One must define previously all inverse functions that are required. Is this       possible? Are there studies on this? Or is it nonsense?              --- 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