Article

Reasoning about the Elementary Functions of Complex Analysis

Authors:

Stephen M. WattAuthors Info & Claims

AISC '00: Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation

Pages 115 - 126

Published: 17 July 2000 Publication History

Abstract

There are many problems with the simplification of elementary functions, particularly over the complex plane. Systems tend to make major errors, or not to simplify enough. In this paper we outline the "unwinding number" approach to such problems, and show how it can be used to prevent errors and to systematise such simplification, even though we have not yet reduced the simplification process to a complete algorithm. The unsolved problems are probably more amenable to the techniques of artificial intelligence and theorem proving than the original problem of complex-variable analysis.

References

[1]

Abramowitz, M. & Stegun, I., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. US Government Printing Office, 1964. 10th Printing December 1972.

Crossref

Google Scholar

[2]

Bradford, R.J., Algebraic Simplification of Multiple-Valued Functions. Proc. DISCO '92 (Springer Lecture Notes in Computer Science 721, ed. J.P. Fitch), Springer, 1993, pp. 13-21.

Crossref

Google Scholar

[3]

CarathÉodory,C., Theory of functions of a complex variable (trans. F. Steinhardt), 2nd. ed., Chelsea Publ., New York, 1958.

Google Scholar

[4]

Corless, R.M., Davenport, J.H., Jeffrey, D.J. & Watt, S.M., "According to Abramowitz and Stegun". To appear in SIGSAM Bulletin. OpenMath Project (Esprit 24969) deliverable 1.4.6.

Crossref

Google Scholar

[5]

Corless, R.M. & Jeffrey, D.J., The Unwinding Number. SIGSAM Bulletin 30 (1996) 2, pp. 28-35.

Crossref

Google Scholar

[6]

Davenport, J.H. & Fischer, H.-C., Manipulation of Expressions. Improving Floating-Point Programming (ed. P.J.L. Wallis), Wiley, 1990, pp. 149-167.

Google Scholar

[7]

Encyclopedia Britannica, 15th. edition. Encyclopedia Britannica Inc., Chicago etc., 15th ed., 1995 printing.

Google Scholar

[8]

IEEE Standard Pascal Computer Programming Language. IEEE Inc., 1983.

Google Scholar

[9]

IEEE Standard 754 for Binary Floating-Point Arithmetic. IEEE Inc., 1985.

Google Scholar

[10]

Kahan, W., Branch Cuts for Complex Elementary Functions. The State of Art in Numerical Analysis (ed. A. Iserles & M.J.D. Powell), Clarendon Press, Oxford, 1987, pp. 165-211.

Google Scholar

[11]

Litt, G., Unwinding numbers for the Logarithmic, Inverse Trigonometric and Inverse Hyperbolic Functions. M.Sc. project, Department of Applied Mathematics, University of Western Ontario, December 1999.

Google Scholar

[12]

Steele, G.L., Jr., Common LISP: The Language, 2nd. edition. Digital Press, 1990.

Crossref

Google Scholar

Cited By

View all

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
Carette JSchicho J(2004)Understanding expression simplificationProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005298(72-79)Online publication date: 4-Jul-2004
https://dl.acm.org/doi/10.1145/1005285.1005298
Bradford RDavenport JGiusti M(2002)Towards better simplification of elementary functionsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780509(16-22)Online publication date: 10-Jul-2002
https://dl.acm.org/doi/10.1145/780506.780509

Recommendations

Reasoning about the Elementary Functions of Complex Analysis

There are many problems with the simplification of elementary functions, particularly over the complex plane, though not exclusively – see (20). Systems tend to make “howlers” or not to simplify enough. In this paper we outline the “unwinding number” ...
Less complex elementary functions

The "textbook" definitions of complex elementary functions---e.g., sin(z)---are usually given in terms of formulae which involve complex operations. In this paper, we give formulae for complex elementary functions in which the real and imaginary parts ...
Complex backpropagation neural network using elementary transcendental activation functions
ICASSP '01: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02

Designing a neural network (NN) for processing complex signals is a challenging task due to the lack of bounded and differentiable nonlinear activation functions in the entire complex domain C. To avoid this difficulty, 'splitting', i.e., using ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

AISC '00: Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation

July 2000

252 pages

ISBN:3540420711

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 July 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

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
Carette JSchicho J(2004)Understanding expression simplificationProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005298(72-79)Online publication date: 4-Jul-2004
https://dl.acm.org/doi/10.1145/1005285.1005298
Bradford RDavenport JGiusti M(2002)Towards better simplification of elementary functionsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780509(16-22)Online publication date: 10-Jul-2002
https://dl.acm.org/doi/10.1145/780506.780509

Abstract

References

Cited By

Recommendations