Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Better answers to real questions
Košta M., Sturm T., Dolzmann A. Journal of Symbolic Computation74 (C):255-275,2016.Type:Article
Date Reviewed: Dec 18 2015

Many scientific problems can be phrased as existential formulas over the real numbers. For example: For a fixed parameter a, are there xy such that x2+ya? Quantifier elimination solves such questions by case distinctions, for example: If a<0, take x=0 and y=a; If a≥0, take y=0 and let x be the square root of a. In general, one has to distinguish between the guards (if a<0) and the answers (take x=0 and y=a). Because the answers should be expressions in the language of real numbers and variables, one can use regular back-substitution to get them. The guards, however, should just involve real numbers, so one has to keep them formal, that is, use virtual back-substitution. (Incidentally, formulas involving higher powers of variables, such as x3, can be reduced by the technique of degree shift, but in section 5, this paper shows how virtual back-substitution incorporates this reduction automatically.)

When the formula involves strict inequalities (x>y) in addition to weak inequalities (xy), the guards can involve open intervals, posing a problem for back-substitution. This problem was traditionally handled by introducing infinitesimal numbers. The contribution of this paper is to convert such a nonstandard solution into a standard one that involves only real numbers. The main results are achieved in section 4. Section 6 improves the solutions to solutions involving only rational numbers. The authors implemented their procedure in Redlog.

The use of these techniques is demonstrated by taking examples from a variety of fields--computational geometry, motion planning, biological networks, chemical reaction networks, and electrical networks--and showing how to turn solutions using infinitesimals into solutions using only rational numbers. These examples justify the pun in the paper’s title.

Reviewer:  Chris Heunen Review #: CR144037 (1603-0217)
Bookmark and Share
 
General (I.1.0 )
 
 
Mathematical Logic (F.4.1 )
 
 
General (F.0 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Mathematics for computer algebra
Mignotte M., Springer-Verlag New York, Inc., New York, NY, 1992. Type: Book (9780387976754)
Feb 1 1993
Computer algebra: systems and algorithms for algebraic computation
Davenport J., Siret Y., Tournier E., Academic Press Ltd., London, UK, 1988. Type: Book (9789780122042300)
Jul 1 1989
Automatic reasoning about numerical stability of rational expressions
Char B.  Symbolic and algebraic computation (, Portland, OR, Jul 17-19, 1989)2411989. Type: Proceedings
Jun 1 1991
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy