A note on complex division

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A note on complex division

Full text

Pdf (219 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 11 , Issue 3 (September 1985) table of contents

Pages: 238 - 241

Year of Publication: 1985

ISSN:0098-3500

Author

G. W. Stewart

Department of Computer Science, Institute for Physical Science and Technology, University of Maryland, College Park, MD

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/214408.214414 What is a DOI?

ABSTRACT

An algorithm for computing the quotient of two complex numbers is modified to make it more robust in the presence of underflows.

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	COONEN, j.T. Underflow and denormalized numbers. Comput. 13, (1980), 68-79.
	2	Robert L. Smith, Algorithm 116: Complex division, Communications of the ACM, v.5 n.8, p.435, Aug. 1962 [doi>10.1145/368637.368661]

CITED BY 2

	C. B. Dunham, Improvement of complex arithmetic by use of double elements, ACM SIGNUM Newsletter, v.24 n.4, p.3-7, Oct. 1989
	Douglas M. Priest, Efficient scaling for complex division, ACM Transactions on Mathematical Software (TOMS), v.30 n.4, p.389-401, December 2004