Electrical computers: arithmetic processing and calculating – Electrical digital calculating computer – Having specialized output
Reexamination Certificate
2001-07-11
2004-12-07
Ngo, Chuong Dinh (Department: 2124)
Electrical computers: arithmetic processing and calculating
Electrical digital calculating computer
Having specialized output
C708S200000
Reexamination Certificate
active
06829626
ABSTRACT:
BACKGROUND OF THE INVENTION
The invention relates to electronic devices, and, more particularly, to computer algebra systems and methods.
Computer algebra systems, which can be found on advanced calculators, personal computers, and other such systems, perform various tasks such as simplifying algebraic expressions, differentiating and integrating simple functions, solving simple differential equations, and so forth. That is, algebraic expressions such as (x+1)
2
−(x−1)
2
typically will be automatically simplified to 4x and these two expressions are equivalent for all values of the variable x. However, many computer algebra systems will automatically simplify algebraic expressions to nonequivalent expressions without warning; for example, ln(xy)−ln(x) could be simplified to ln(y). But for negative x and y this simplification yields incorrect results: for x=−1=y, ln(xy)−ln(x)=ln(1)−ln(−1)=−&igr;&pgr;, whereas ln(y)=ln(−1)=&igr;&pgr;.
Various known computer algebra systems attempt to avoid simplifications which yield nonequivalent expressions. Indeed, the computer algebra system could simplify an expression only when the variables are constrained (as by the user) to insure the transformed expression will be equivalent. For example, a constraint that at least one of the variables x and y is positive is sufficient for ln(xy)−ln(x) to be simplified to ln(y). But this requires the user to anticipate the problem.
Other computer algebra systems approach the nonequivalent expression difficulty by querying the user for constraints which will insure equivalency. But such as system may force the user to repeatedly submit input with all possible combinations of replies to obtain a complete solution, and many combinations might lead to the same result, which is frustrating for the user. Moreover, such queries can arise for internally generated variables for which the user has no knowledge. For example, a differential equation solver that tries many methods including the Laplace transform method might ask the user about the sign of s (the transform variable) when there is no such variable in the user's input. Such queries can be totally baffling to users. Finally, interactive queries are totally inappropriate for batch computation and for such lengthy interactive computations that the user wants to leave the machine running and then return to see the final result after a lengthy period of time.
An alternative approach computes a domain of definition for each algebraic expression (together with any user-supplied constraints on the variables' domains) and outputs a domain of definition together with a simplified expression. For example, the input expression “√x−√x such that x>−3” where x>−3 is a user supplied constraint of the variable x, would result in an output “0 such that x≧0”. Note that the constraints x≧0 (from the domain of definition of √) and x>−3 were combined. See the method of Dolzmann et al, Guarded Expressions in Practice, Proc. 1997 Intl. Symp. Symbolic and Algebraic Computation, pp. 376-382 (ACM NY, N.Y.; ISBN 0-89791-875-4), which provides an output of possibly several conventional expressions guarded by quantifier-free formulas. However, this involves unnecessary computation and often results in a cluttered display of results.
SUMMARY OF THE INVENTION
The present invention provides computer algebra systems with domain preservation constraints displayed with a transformed expression which has an apparent domain of definition differing from the domain of definition of the original expression.
This has advantages including elimination of extraneous displays of constraints and/or extraneous domain of definition computations.
REFERENCES:
patent: 4845652 (1989-07-01), Bunsen
patent: 5189633 (1993-02-01), Bonadio
patent: 5526475 (1996-06-01), Razdow
Hoel Carlton H.
Ngo Chuong Dinh
LandOfFree
Computer algebra system and method does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Computer algebra system and method, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computer algebra system and method will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3323077