Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Computing in transcendental extensions.
Norman A.   (,2000.Type:Proceedings
Date Reviewed: Feb 1 1985

Performing the rational operations in a field extended by a transcendental element is equivalent to performing arithmetic in the field of rational functions over the field. The computational difficulty associated with such extensions is in verifying that proposed extensions are transcendental. When the extensions being considered are functions, and where a differentiation operator can be defined for them, structure theorems can be used to determine the character of the extension and to exhibit a relationship between the adjoined element and existing quantities in case the adjoined element is not transcendental.

--Author’s Abstract

In this short note the structure theorem for elementary transcendental function fields is described. The use of structure theorems is illustrated with an example from [1] which is worked out well.

--B. D. Saunders, Newark, DE

Reviewer:  David Saunders Review #: CR124206
1) Caviness, B. F. ethods for symbolic computation with transcendental functions, in Proc. of the fourth int’l colloquiam on advanced computing methods in theoretical physic (St. Maximin, France, 1977), 16-43.
Bookmark and Share
 
Analysis Of Algorithms (I.1.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Analysis Of Algorithms": Date
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II
Averbuch A., Galil Z., Winograd S. Theoretical Computer Science 86(2): 143-203, 1991. Type: Article
Dec 1 1992
Parallel algorithms for algebraic problems
von zur Gathen J. (ed) SIAM Journal on Computing 13(4): 802-824, 1984. Type: Article
May 1 1985
There is no “Uspensky’s method.”
Akritis A.  Symbolic and algebraic computation (, Waterloo, Ont., Canada, Jul 21-23, 1986)901986. Type: Proceedings
Sep 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy