Computing floating-point gröbner bases stably

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing floating-point gröbner bases stably

Full text

Pdf (273 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 2007 international workshop on Symbolic-numeric computation table of contents

London, Ontario, Canada

SESSION: Contributed full papers table of contents

Pages: 180 - 189

Year of Publication: 2007

ISBN:978-1-59593-744-5

Authors

Tateaki Sasaki	University of Tsukuba, Tsukuba-Shi, Japan
Fujio Kako	Nara Women's University, Nara-shi, Japan

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 42, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

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/1277500.1277526 What is a DOI?

ABSTRACT

Computing floating-point gröbner bases stably.

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	George E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM (JACM), v.14 n.1, p.128-142, Jan. 1967 [doi>10.1145/321371.321381]
	2	J.-C. Faugère.A new e cient algorithm for computing Gröbner bases (F 4 .J. Pure Appl. Algebra 139 (1999), 61--88.
	3	E. Fortuna, P. Gianni and B. Trager. Degree reduction under specialization. J. Pure Appl. Algebra 164 (2001),153--164.
	4	S. Y. Ku , R. J. Adler, Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm, Communications of the ACM, v.12 n.1, p.23-30, Jan. 1969 [doi>10.1145/362835.362839]
	5	F. Kako and T. Sasaki. Proposal of "effective" floating-point number. Preprint of Univ.Tsukuba, May 1997 (unpublished).
	6	A. Kondratyev, H. J. Stetter and S. Winkler. Numerical computation of Gr öbner bases. Proceedings of CASC2004 (Computer Algebra in Scientific Computing) 295--306, St. Petersburg, Russia, 2004.
	7	B. Mourrain. Pythagore's dilemma, symbolic-numeric computation, and the border basis method. Symbolic-Numeric Computations (Trends in Mathematics)223--243, Birkhä user Verlag, 2007.
	8	T. Ohyoshi. Effectiveness of "efloat numbers "in approximate algebra (in Japanese). Master thesis of Univ. Tsukuba,March 2003.
	9	Kiyoshi Shirayanagi, An algorithm to compute floating point Gro¨bner bases, Proceedings of the Maple summer workshop and symposium on Mathematical computation with Maple V : ideas and applications: ideas and applications, p.95-106, July 1993, Ann Arbor, Michigan, United States
	10	Kiyoshi Shirayanagi, Floating point Gro¨bner bases, Mathematics and Computers in Simulation, v.42 n.4-6, p.509-528, Nov. 1996
	11	T. Sasaki, T. Kitamoto and F. Kako.Error analysis of power-series roots of multivariate algebraic equation. March 1994 (submitted).
	12	T. Sasaki , M. Sasaki, Analysis of accuracy decreasing in polynomial remainder sequence with floating-point number coefficients, Journal of Information Processing, v.12 n.4, p.394-403, 1989
	13	Tateaki Sasaki , Mutsuko Sasaki, Polynomial remainder sequence and approximate GCD, ACM SIGSAM Bulletin, v.31 n.3, p.4-10, Sept. 1997 [doi>10.1145/271130.271131]
	14	Tateaki Sasaki , Tomoyuki Sato, Cancellation errors in multivariate resultant computation with floating-point numbers, ACM SIGSAM Bulletin, v.32 n.4, p.13-20, Dec. 1998 [doi>10.1145/307733.307738]
	15	M. Sanuki and T. Sasaki. Computing approximate GCD's in ill-conditioned cases. This proceedings.
	16	Hans J. Stetter, Stabilization of polynomial systems solving with Groebner bases, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.117-124, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258763]
	17	H. J. Stetter. Approximate Gröbner bases -- an impossible concept? Proceedings of SNC2005 (Symbolic-Numeric Computation)235--236, Xi'an, China,2005.
	18	H. J. Stetter. Proposal of the algorithmic use of the BKK-number in the algebraic reduction of a 0-dimensional polynomial system.Symbolic-Numeric Computations (Trends in Mathematics)245--267, Birkhäuser Verlag, 2007.
	19	Tateaki Sasaki , Satoshi Yamaguchi, An analysis of cancellation error in multivariate Hensel construction with floating-point number arithmetic, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.1-8, August 13-15, 1998, Rostock, Germany [doi>10.1145/281508.281521]
	20	C. Traverso. Syzygies, and the stabilization of numerical Buchberger algorithm. Proceedings of LMCS2002 (Logic, Mathematics and Computer Science) 244--255, RISC-Linz, Austria, 2002.
	21	Carlo Traverso , Alberto Zanoni, Numerical stability and stabilization of Groebner basis computation, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.262-269, July 07-10, 2002, Lille, France [doi>10.1145/780506.780540]
	22	V. Weispfenning. Gröbner bases for inexact input data. Proceedings of CASC2003 (Computer Algebra in Scientific Computing) 403--411, Passau, Germany, 2002.