Function evaluation on branch cuts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Function evaluation on branch cuts

Full text

Pdf (278 KB)

Source

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

Pages: 25 - 27

Year of Publication: 1996

ISSN:0163-5824

Authors

Albert D. Rich	Soft Warehouse, Honolulu, Hawaii, and Department of Applied Math, London, Canada
David J. Jeffrey	Soft Warehouse, Honolulu, Hawaii, and Department of Applied Math, London, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 18, Downloads (12 Months): 35, Citation Count: 2

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.235704 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	Robert M. Corless , David J. Jeffrey, The unwinding number, ACM SIGSAM Bulletin, v.30 n.2, p.28-35, June 1996 [doi>10.1145/235699.235705]
	2	[2] 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 2

	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
	Robert M. Corless , David J. Jeffrey, The unwinding number, ACM SIGSAM Bulletin, v.30 n.2, p.28-35, June 1996