Singular systems of polynomials

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Singular systems of polynomials

Full text

Pdf (263 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1998 international symposium on Symbolic and algebraic computation table of contents

Rostock, Germany

Pages: 9 - 16

Year of Publication: 1998

ISBN:1-58113-002-3

Authors

Hans J. Stetter	Institut für Angewandte und Numerische Mathematik, Technische Universität Wien, Austria
Günther H. Thallinger	Institut für Angewandte und Numerische Mathematik, Technische Universität Wien, Austria

Sponsors

German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 2

Additional Information:

references cited by 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/281508.281525 What is a DOI?

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	Gene H. Golub , Charles F. Van Loan, Matrix computations (3rd ed.), Johns Hopkins University Press, Baltimore, MD, 1996
	2	KUNZ, E. Einfiihrung in die kommutative Algebra und algebraische Geometrie. F. Vieweg & Sohn, 1979, ch. V.
	3	(~)TTLI, W., AND PRAGER, W. Compatibility of approximate solutions of linear equations with given error bounds for coefficients and right hand sides. Numer. Math 6 (1964), 405-409.
	4	J. Maurice Rojas, A convex geometric approach to counting the roots of a polynomial system, Theoretical Computer Science, v.133 n.1, p.105-140, Oct. 10, 1994
	5	STETTER, H. Zeros of polynomial systems with coefficients of limited accuracy. In preparation.
	6	Hans J. Stetter, Analysis of zero clusters in multivariate polynomial systems, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.127-136, July 24-26, 1996, Zurich, Switzerland [doi>10.1145/236869.236919]
	7	Hans J. Stetter, Matrix eigenproblems are at the heart of polynomial system solving, ACM SIGSAM Bulletin, v.30 n.4, p.22-25, Dec. 1996 [doi>10.1145/242961.242966]
	8	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]
	9	STETTER, H., AND THALLINGER, G. Zero clusters in near-singular polynomial systems. Submitted to 5th Int.Symp. on Effective Methods in Algebr. Geom. (MEGA 98), 1998.
	10	THALLINGER, G. Zero Behavior in Perturbed Systems of Polynomial Equations. Ph.D. thesis, Tech. Univ. Vienna, Institute of Applied and Numerical Mathematics, 1998.
	11	Volker Weispfenning, Comprehensive Gro¨bner bases, Journal of Symbolic Computation, v.14 n.1, p.1-29, July 1992 [doi>10.1016/0747-7171(92)90023-W]

CITED BY 2

	Johannes Grabmeier , Erich Kaltofen , Volker Weispfenning, Cited References, Computer algebra handbook, Springer-Verlag New York, Inc., New York, NY, 2003
	Marc Moreno Maza , Greg Reid , Robin Scott , Wenyuan Wu, On approximate triangular decompositions in dimension zero, Journal of Symbolic Computation, v.42 n.7, p.693-716, July, 2007