A representation of branch-cut information

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A representation of branch-cut information

Full text

Pdf (206 KB)

Source

ACM SIGSAM Bulletin archive
Volume 30 , Issue 2 (June 1996) table of contents

Pages: 21 - 24

Year of Publication: 1996

ISSN:0163-5824

Author

Charles M. Patton

APCD Corvallis Design Center, Hewlett-Packard Co., Corvallis, OR

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 27, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/235699.235703 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	[1] Sam Dooley, private communication.
	2	[2] W. Kahan, private communication.
	3	[3] W. Kahan, "Branch cuts for complex elementary functions", in The State of the Art in Numerical Analysis: Proceedings of the Joint IMA/SIAM Conference on the State of the Art in Numerical Analysis, University of Birmingham, April 14-18, 1986, M. J. D. Powell and A. Iserles, Eds, Oxford University Press.

CITED BY 3

	D. J. Jeffrey , A. C. Norman, Not seeing the roots for the branches: multivalued functions in computer algebra, ACM SIGSAM Bulletin, v.38 n.3, September 2004
	James C. Beaumont , Russell J. Bradford , James H. Davenport , Nalina Phisanbut, A poly-algorithmic approach to simplifying elementary functions, Proceedings of the 2004 international symposium on Symbolic and algebraic computation, p.27-34, July 04-07, 2004, Santander, Spain
	Robert M. Corless , David J. Jeffrey, The unwinding number, ACM SIGSAM Bulletin, v.30 n.2, p.28-35, June 1996