Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Subresultants under composition
Hong H. Journal of Symbolic Computation23 (4):355-365,1997.Type:Article
Date Reviewed: Apr 1 1998

Let A and B denote polynomials of degrees m and n in a variable x over an integral domain D. As usual, if M = M A , B is the corresponding Sylvester matrix, then the kth subresultant is the polynomial where Mk ( i ) denotes the submatrix of M consisting of the first n - k and m - k rows of the A and B coefficients, respectively, and the first m + n - 2 k - 1 columns as well as the m + n - k - ith column. For any polynomial C in x over D, let A ○ C and B ○ C be the polynomials obtained from A and B by replacing x with C. The author investigates the effect of such composition upon the subresultants and shows that sresk ( A ○ C , B ○ C ) = p μ sres μ ( A , B ) ○ C when k = ℓ μ, sresk ( A ○ C , B ○ C ) = q μ sres μ - 1 ( A , B ) ○ C when k = ℓ μ - 1, and sresk ( A ○ C , B ○ C ) = 0 otherwise. Here is the degree of C, and p μ and q μ are specified constants. This result generalizes the well-known fact that the resultant resk ( A , B ) = det M A , B is invariant under translation.

Reviewer:  W. C. Rheinboldt Review #: CR121055 (9804-0264)
Bookmark and Share
 
Expressions And Their Representation (I.1.1 )
 
 
Computations On Polynomials (F.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Expressions And Their Representation": Date
Unification theory
Siekmann J. Journal of Symbolic Computation 7(3-4): 207-274, 1989. Type: Article
Mar 1 1990
Boolean unification--the story so far
Martin U., Nipkow T. (ed) Journal of Symbolic Computation 7(3-4): 275-293, 1989. Type: Article
Mar 1 1990
Modern computer algebra
von zur Gathen J. (ed), Gerhard J., Cambridge University Press, New York, NY, 1999. Type: Book (9780521641760)
Oct 1 1999
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