Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Fraction-free factoring revisited
Middeke J., Jeffrey D. ACM Communications in Computer Algebra48 (3/4):130-132,2014.Type:Article
Date Reviewed: Jul 16 2015

This is the abstract of a poster presented at the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2014 dealing with Gaussian elimination over a ring R, and hence “fraction free,” that is, not working in the field of quotients. The paper states:

In particular, we set out to confirm popular beliefs about fraction-free methods. For instance, [1] remarks (without any further source or proof) that the preferred pivoting strategy in symbolic Gaussian elimination as opposed to numerical methods is to choose always the smallest possible pivot (with a suitable measure of size depending on R). Our experiments confirmed that this strategy leads to the smallest output.

Unfortunately, this paper also contains no source or proof, and the experimental results are not given. In this day and age, an abstract of a poster should at least contain a link to the original poster.

The authors extend their observation in [2] that even using the Bareiss-Dodgson method, which removes all structural common factors, there are still many more common factors in any example than one would reasonably expect. This is, as they say, a promising area for future research.

Reviewer:  J. H. Davenport Review #: CR143622 (1510-0895)
1) Geddes, K. O.; Czapor, S.; Labahn, G. Algorithms for computer algebra. Kluwer Academic Publishers, Dordrecht, the Netherlands, 1992.
2) Middeke, J.; Almohaimeed, A.; Jeffrey, D. J. Common factors in fraction-free matrix reduction. In Proc. of SYNASC 2013. IEEE, 2013, 76–80.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
 
Algebraic Algorithms (I.1.2 ... )
 
 
Matrix Inversion (G.1.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Nonnumerical Algorithms And Problems": Date
Improving the performance guarantee for approximate graph coloring
Wigderson A. Journal of the ACM 30(4): 729-735, 1983. Type: Article
Feb 1 1985
Fast algorithms constructing minimal subalgebras, congruences, and ideals in a finite algebra
Demel J., Demlová M., Koubek V. Theoretical Computer Science 36(2-3): 203-216, 1985. Type: Article
Jan 1 1986
Complexity of the word problem for commutative semigroups of fixed dimension
Huynh D. Acta Informatica 22(4): 421-432, 1985. Type: Article
May 1 1986
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