poster

Geometry of branch cuts

Authors:

Nalina Phisanbut,

Russell J. Bradford,

James H. DavenportAuthors Info & Claims

ACM Communications in Computer Algebra, Volume 44, Issue 3/4

Pages 132 - 135

https://doi.org/10.1145/1940475.1940500

Published: 28 January 2011 Publication History

Get Access

References

[1]

Beaumont, J., Bradford, R., Davenport, J., and Phisanbut, N. A Poly-Algorithmic Approach to Simplifying Elementary Functions. In Proceedings ISSAC 2004 (2004), J. Gutierrez, Ed., pp. 27--34.

Digital Library

Google Scholar

[2]

Beaumont, J., Bradford, R., Davenport, J., and Phisanbut, N. Adherence is Better Than Adjacency. In Proceedings ISSAC 2005 (2005), M. Kauers, Ed., pp. 37--44.

Digital Library

Google Scholar

[3]

Beaumont, J., Bradford, R., Davenport, J., and Phisanbut, N. Testing Elementary Function Identities Using CAD. AAECC 18 (2007), 513--543.

Digital Library

Google Scholar

[4]

Beaumont, J., Bradford, R., and Phisanbut, N. Practical Simplification of Elementary Functions Using CAD. In Proceedings A3L (2005), pp. 35--40.

Google Scholar

[5]

Bradford, R., and Davenport, J. Towards Better Simplification of Elementary Functions. In Proceedings ISSAC 2002 (2002), T. Mora, Ed., pp. 15--22.

Digital Library

Google Scholar

[6]

Brown, C. QEPCAD B: a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin 4 37 (2003), 97--108.

Digital Library

Google Scholar

[7]

Chen, C., Moreno Maza, M., Xia, B., and Yang, L. Computing Cylindrical Algebraic Decomposition via Triangular Decomposition. In Proceedings ISSAC 2009 (2009), J. May, Ed., pp. 95--102.

Digital Library

Google Scholar

[8]

Collins, G. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. In Proceedings 2nd. GI Conference Automata Theory & Formal Languages (1975), pp. 134--183.

Digital Library

Google Scholar

[9]

Dingle, A., and Fateman, R. Branch cuts in computer algebra. In Proceedings ISSAC 1994 (1994), pp. 250--257.

Digital Library

Google Scholar

[10]

Moses, J. Algebraic Simplification --- A Guide for the Perplexed. Comm. ACM 14 (1971), 527--537.

Digital Library

Google Scholar

Cited By

View all

Bradford RDavenport JEngland MMcCallum SWilson DMonagan MCooperman GGiesbrecht M(2013)Cylindrical algebraic decompositions for boolean combinationsProceedings of the 38th International Symposium on Symbolic and Algebraic Computation10.1145/2465506.2465516(125-132)Online publication date: 26-Jun-2013
https://dl.acm.org/doi/10.1145/2465506.2465516
England MBradford RDavenport JWilson D(2013)Understanding branch cuts of expressionsProceedings of the 2013 international conference on Intelligent Computer Mathematics10.1007/978-3-642-39320-4_9(136-151)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39320-4_9
Chen CDavenport JLemaire FMaza MXia BXiao RXie Y(2012)Computing the real solutions of polynomial systems with the RegularChains library in MapleACM Communications in Computer Algebra10.1145/2110170.211017445:3/4(166-168)Online publication date: 23-Jan-2012
https://dl.acm.org/doi/10.1145/2110170.2110174
Show More Cited By

Index Terms

Geometry of branch cuts

Recommendations

On the Rank of Disjunctive Cuts

Let L be a family of lattice-free polyhedra in R^m containing the splits. Given a polyhedron P in R^{m + n}, we characterize when a valid inequality for P ∩ (Z^m × Rⁿ) can be obtained with a finite number of disjunctive cuts corresponding to the polyhedra in ...
Computing generalized ham-sandwich cuts

Barany et al. (2008) [1] proved that, for any @b@?[0,1]^d and any d well-separated convex bodies S"1,S"2,...,S"d in R^d, there exists a hyperplane (a generalized ham-sandwich cut) splitting the volume of S"i as (@b"i,1-@b"i) for all i. Steiger and Zhao (...
Branch cuts in computer algebra
ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation

Most computer algebra systems provide little assistance in working with expressions involving functions with complex branch cuts. Worse, by their ignorance of the existence of branch cuts, algebra systems sometimes simplify complex expressions ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Communications in Computer Algebra

ACM Communications in Computer Algebra Volume 44, Issue 3/4

September/December 2010

145 pages

ISSN:1932-2232

EISSN:1932-2240

DOI:10.1145/1940475

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 January 2011

Published in SIGSAM-CCA Volume 44, Issue 3/4

Check for updates

Qualifiers

Poster

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
80
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bradford RDavenport JEngland MMcCallum SWilson DMonagan MCooperman GGiesbrecht M(2013)Cylindrical algebraic decompositions for boolean combinationsProceedings of the 38th International Symposium on Symbolic and Algebraic Computation10.1145/2465506.2465516(125-132)Online publication date: 26-Jun-2013
https://dl.acm.org/doi/10.1145/2465506.2465516
England MBradford RDavenport JWilson D(2013)Understanding branch cuts of expressionsProceedings of the 2013 international conference on Intelligent Computer Mathematics10.1007/978-3-642-39320-4_9(136-151)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39320-4_9
Chen CDavenport JLemaire FMaza MXia BXiao RXie Y(2012)Computing the real solutions of polynomial systems with the RegularChains library in MapleACM Communications in Computer Algebra10.1145/2110170.211017445:3/4(166-168)Online publication date: 23-Jan-2012
https://dl.acm.org/doi/10.1145/2110170.2110174
Chen CDavenport JMoreno Maza MXia BXiao RSchost ÉEmiris I(2011)Computing with semi-algebraic sets represented by triangular decompositionProceedings of the 36th international symposium on Symbolic and algebraic computation10.1145/1993886.1993903(75-82)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.1145/1993886.1993903

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On the Rank of Disjunctive Cuts

Computing generalized ham-sandwich cuts

Branch cuts in computer algebra