Fast computation of numerical partial fraction decompositions and contour integrals of rational functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fast computation of numerical partial fraction decompositions and contour integrals of rational functions

Full text

Pdf (969 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents

Berkeley, California, United States

Pages: 16 - 26

Year of Publication: 1992

ISBN:0-89791-489-9

Author

Peter Kirrinnis

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 14, Citation Count: 3

Additional Information:

references cited by index terms peer to peer

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/143242.143258 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	ALT, H. Multiplication is the easiest nontrivial arithmetic function. Theor. Comp. Sci. 36, 333- 339, 1985.
	2	BOI~WEIN, J.M. and BORWEIN, P.B. The arithmetic- geometric mean and fast computation of elementary functions. SIAM Rev. 26,351-366, 1984.
	3	BORWEIN, J.M. and BORWEIN, P.B. Pi and the A GM. Wiley & Sons, New York, 1987.
	4	Richard P. Brent, Fast Multiple-Precision Evaluation of Elementary Functions, Journal of the ACM (JACM), v.23 n.2, p.242-251, April 1976 [doi>10.1145/321941.321944]
	5	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	6	MIGNOTTE, M. An inequality about factors of polynomials. Math. Comp. 28, 1153-1157, 1974.
	7	OSTROWSKI, A. Recherches sur la mdthode de Graeffe el les zdros de polynomes et les sdries de Laurent. Acta Math. 72, 99-257, 1940. (In French).
	8	PdLYA, G. and SZEGS, G. Problems and Theorems in Analysis, vol. i. Springer, New York, 1972.
	9	SCHATZLE, R. Zitr StSrung der Nullslellen yon komplexen Polynomen. Diplomarbeit, Univ. of Bonn, Dept. Math., 1990. (In German).
	10	SCH()NHAGE, A. Storage modification machines. SIAM J. Comput. 9,490-508, 1980.
	11	Arnold Schönhage, Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.3-15, April 05-07, 1982
	12	SCHONHAGE, A. The fundamental theorem of algebra in terms of computational complexity. Technical report, Univ. of Tiibingen, 1982. 74 pp.
	13	SCHONHAGE, i. Quasi-GCD computations. J. of Complexity 1, t18-137, 1985.
	14	SCH()NHAGE, A. Equation solving in terms of computational complexity. In Proc. Int. Congress of Mathem., Berkeley (CA) 1986, volume 1,131-153, 1986.
	15	SCHONHAGE, A. Numerik analytischer Funktionen und Komplexith't. In Jber. d. Dr. Math.-Verein. 92, 1-20. Teubner, Stuttgart, 1990. (In German).
	16	SCHI~NHAGE, A. and STrtASSEN, V. Schnelle Multiplikation grofler Zahlen. Computing 7, 281-292, 1969. (in German).

CITED BY 3

	Peter Kirrinnis, Fast numerical improvement of factors of polynomials and of partial fractions, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.260-267, August 13-15, 1998, Rostock, Germany
	Victor Y. Pan, Univariate polynomials: nearly optimal algorithms for factorization and rootfinding, Proceedings of the 2001 international symposium on Symbolic and algebraic computation, p.253-267, July 2001, London, Ontario, Canada
	Victor Y. Pan, Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding, Journal of Symbolic Computation, v.33 n.5, p.701-733, May 2002