Article

Free access

Branch cuts in computer algebra

Authors:

Adam Dingle,

Richard J. FatemanAuthors Info & Claims

ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation

Pages 250 - 257

https://doi.org/10.1145/190347.190424

Published: 01 August 1994 Publication History

PDF eReader

Abstract

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 incorrectly. We propose a computer representation for branch cuts; we show how a complex expression's branch cuts may be mechanically computed, and how an expression with branch cuts may sometimes be algebraically simplified within each of its branches.

References

[1]

G. F. Carrier, M. Krook, and C. E. Pearson. Functions of a Complez Variable: Theory and Techniques, McGraw-Hill, 1966.]]

Digital Library

Google Scholar

[2]

B. W. Char, K. 0. Geddes, et al. Maple V Library Reference Manual, (and other volumes) Springer-Verlag, 1991.]]

Google Scholar

[3]

Richard D. Jenks and Robert S. Sutor. AXIOM the Scientific Computation System. NAG and Springer Verlag, NY, 1992.]]

Digital Library

Google Scholar

[4]

A. Dingle. "Branch Cuts in Computer Algebra," Master's Thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1991.]]

Google Scholar

[5]

W. Kahan. "instead of UNLN', unpublished paper, April 1991.]]

Google Scholar

[6]

H. Kober. Dictionary of Conformal Representations, Dover, 1957.]]

Google Scholar

[7]

Macsyma Inc. Macsyma Be/erence Manual, Version 14, 1991.]]

Google Scholar

[8]

Z. Nehari. Gonformal Mapping, McGraw-Hill, 1952.]]

Google Scholar

[9]

H. Seymour. "Conform: A Conformal Mapping System", Master's Thesis, Department of Electrical Engineering and Computer Science, University of California at Berkeley, 1985.]]

Google Scholar

[10]

S. Wolfram. Mathematica, A System for Doing Mathematics by Computer, Second edition, Addison-Wesley, 1991.]]

Digital Library

Google Scholar

Cited By

View all

MacCallum M(2018)Computer algebra in gravity researchLiving Reviews in Relativity10.1007/s41114-018-0015-621:1Online publication date: 20-Aug-2018
https://doi.org/10.1007/s41114-018-0015-6
England MCheb-Terrab EBradford RDavenport JWilson D(2014)Branch cuts in maple 17ACM Communications in Computer Algebra10.1145/2644288.264429348:1/2(24-27)Online publication date: 10-Jul-2014
https://dl.acm.org/doi/10.1145/2644288.2644293
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
Show More Cited By

Index Terms

Branch cuts in computer algebra
1. Computing methodologies
  1. Symbolic and algebraic manipulation
2. Mathematics of computing
  1. Mathematical software

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 (...
Understanding branch cuts of expressions
CICM'13: Proceedings of the 2013 international conference on Intelligent Computer Mathematics

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse trigonometric ...

Comments

Information & Contributors

Information

Published In

ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation

August 1994

359 pages

ISBN:0897916387

DOI:10.1145/190347

Chairman:
Malcolm MacCallum
QMW, London, UK

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC94

Sponsor:

SIGSAM

ISSAC94: International Symposium on Symbolic and Algebraic Computation

July 20 - 22, 1994

Oxford, United Kingdom

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
421
Total Downloads

Downloads (Last 12 months)51
Downloads (Last 6 weeks)15

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

MacCallum M(2018)Computer algebra in gravity researchLiving Reviews in Relativity10.1007/s41114-018-0015-621:1Online publication date: 20-Aug-2018
https://doi.org/10.1007/s41114-018-0015-6
England MCheb-Terrab EBradford RDavenport JWilson D(2014)Branch cuts in maple 17ACM Communications in Computer Algebra10.1145/2644288.264429348:1/2(24-27)Online publication date: 10-Jul-2014
https://dl.acm.org/doi/10.1145/2644288.2644293
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
Walker I(2012)Mathematical calculationsReliability in Scientific Research10.1017/CBO9780511780608.003(36-57)Online publication date: 5-Jun-2012
https://doi.org/10.1017/CBO9780511780608.003
Phisanbut NBradford RDavenport J(2011)Geometry of branch cutsACM Communications in Computer Algebra10.1145/1940475.194050044:3/4(132-135)Online publication date: 28-Jan-2011
https://dl.acm.org/doi/10.1145/1940475.1940500
Chyzak FDavenport JKoutschan CSalvy B(2011)On Kahan's Rules for Determining Branch CutsProceedings of the 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing10.1109/SYNASC.2011.51(47-51)Online publication date: 26-Sep-2011
https://dl.acm.org/doi/10.1109/SYNASC.2011.51
Beaumont JBradford RDavenport JPhisanbut NGao XLabahn G(2005)Adherence is better than adjacencyProceedings of the 2005 international symposium on Symbolic and algebraic computation10.1145/1073884.1073892(37-44)Online publication date: 24-Jul-2005
https://dl.acm.org/doi/10.1145/1073884.1073892
Jeffrey DNorman A(2004)Not seeing the roots for the branchesACM SIGSAM Bulletin10.1145/1040034.104003638:3(57-66)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1145/1040034.1040036
Beaumont JBradford RDavenport JPhisanbut NSchicho J(2004)A poly-algorithmic approach to simplifying elementary functionsProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005292(27-34)Online publication date: 4-Jul-2004
https://dl.acm.org/doi/10.1145/1005285.1005292
Dunstan MKelsey TMartin ULinton S(1999)Formal methods for extensions to CASFM’99 — Formal Methods10.1007/3-540-48118-4_43(1758-1777)Online publication date: 17-Sep-1999
https://doi.org/10.1007/3-540-48118-4_43
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Understanding branch cuts of expressions

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

On the Rank of Disjunctive Cuts

Computing generalized ham-sandwich cuts

Understanding branch cuts of expressions

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations