Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Risch algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Decidability== The Risch algorithm applied to general elementary functions is not an algorithm but a [[RE (complexity)|semi-algorithm]] because it needs to check, as a part of its operation, if certain expressions are equivalent to zero ([[constant problem]]), in particular in the constant field. For expressions that involve only functions commonly taken to be [[elementary function|elementary]] it is not known whether an algorithm performing such a check exists (current [[computer algebra system]]s use heuristics); moreover, if one adds the [[absolute value|absolute value function]] to the list of elementary functions, then it is known that no such algorithm exists; see [[Richardson's theorem]]. This issue also arises in the [[polynomial division algorithm]]; this algorithm will fail if it cannot correctly determine whether coefficients vanish identically.<ref>{{Cite web| title= Mathematica 7 Documentation: PolynomialQuotient| url= http://reference.wolfram.com/mathematica/ref/PolynomialQuotient.html| work= Section: Possible Issues| access-date= July 17, 2010}}</ref> Virtually every non-trivial algorithm relating to polynomials uses the polynomial division algorithm, the Risch algorithm included. If the constant field is [[computable]], i.e., for elements not dependent on {{math|''x''}}, then the problem of zero-equivalence is decidable, so the Risch algorithm is a complete algorithm. Examples of computable constant fields are {{math|ℚ}} and {{math|ℚ(''y'')}}, i.e., rational numbers and rational functions in {{mvar|''y''}} with rational-number coefficients, respectively, where {{math|''y''}} is an indeterminate that does not depend on {{math|''x''}}. This is also an issue in the [[Gaussian elimination]] matrix algorithm (or any algorithm that can compute the [[nullspace]] of a matrix), which is also necessary for many parts of the Risch algorithm. Gaussian elimination will produce incorrect results if it cannot correctly determine whether a pivot is identically zero{{Citation needed|date=January 2012}}.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)