On multiple zeros of systems of algebraic equations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On multiple zeros of systems of algebraic equations

Full text

Pdf (791 KB)

Source

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

Vancouver, British Columbia, Canada

Pages: 23 - 30

Year of Publication: 1999

ISBN:1-58113-073-2

Authors

Schuichi Moritsugu	University of Library and Information Science, Tsukuba, Ibaraki, 305-8550, Japan
Kazuko Kuriyama	National Center for Science Information Systems, Bunkyo, Tokyo 112-8640, Japan

Sponsors

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): 6, Downloads (12 Months): 16, Citation Count: 3

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/309831.309846 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	AUZINGER, W.. AND STETTER, H. J. An Elimination Algorithnl for the Computation of All Zeros of a System of Multivariate Polynomial Equations. In Numerical Mathematics Singapore 1988 (1988), vol. 86 of Intern, ational Series of Numerical Mathematics, Pl). 11--30.
	2	BUCHBERGER, B. Ein Algorithmus zum Auffinden dcr Basiselemertte des Restklassenringes nach einem nulldimensionalen Polynomideal. PAD thesis. Universitfit hmsbruck, 1965.
	3	BUCHBEr{GER, B. Ein Algorithmisches Kriterium fiir (tie LSsbarkeit eines algebraischen Gleichungssystems. Acquationcs Mathematicae 4, 3 (1970), 374-383.
	4	Robert M. Corless, Gro¨bner bases and matrix eigenproblems, ACM SIGSAM Bulletin, v.30 n.4, p.26-32, Dec. 1996 [doi>10.1145/242961.242968]
	5	Robert M. Corless , Patrizia M. Gianni , Barry M. Trager, A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.133-140, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258767]
	6	C,c)x, D., LITTLE, Z., AND O'SIIEA: D. Using Algebraic Geometry. Springer, 1998.
	7	J. C. Faugère , P. Gianni , D. Lazard , T. Mora, Efficient computation of zero-dimensional Gro¨bner bases by change of ordering, Journal of Symbolic Computation, v.16 n.4, p.329-344, Oct. 1993 [doi>10.1006/jsco.1993.1051]
	8	GEI.FAND, I. M., KAPRANOV, 1~,I. ~':I., AND ZELEVIN- SKY. A. V. Discriminants, Resultants and Multidimensional Determinants. Birklrgltser, 1994.
	9	KiN. T.. ANI) IRl, M. Jordan Normal Form. Unix:. of Tokyo Press, 1982. (in Japanese').
	10	H. Kobayashi , T. Fujise , A. Furukawa, Solving systems of algebraic equations by a general elimination method, Journal of Symbolic Computation, v.5 n.3, p.303-320, June 1988 [doi>10.1016/S0747-7171(88)80032-4]
	11	LAZARI), D. Alg~bre lin~aire sur K{x~,x.2,...,x,} et c~limination. Bull.Sot.Math.France 105, 2 (1977), 165.. 190.
	12	LAZARD, D. R~solution des syst~mes d'dquations a.lg~.briques. Theor. Comp.Sci. 15 (1981), 77-110.
	13	M. G. Marinari , H. M. Möller , T. Mora, Gröbner bases of ideals given by dual bases, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.55-63, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120702]
	14	H. Michael Möller, Systems of Algebraic Equations Solved by Means of Endomorphisms, Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.43-56, May 10-14, 1993
	15	H. Michael Möller , Hans J. Stetter, Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems, Numerische Mathematik, v.70 n.3, p.311-329, May 1995 [doi>10.1007/s002110050122]
	16	MORI'VSUGU, S., AND KUll.IYAMA, K. A Linear Algebra Mettlod tbr Solving Sy.,stelns of Algebraic E.q~lations. RISC-Linz Report Series 97-35, RISC-Linz, 1997. (ht t t)://www, l'isc, uni-linz, ac. a t/library/).
	17	STWr:I'ER, H. J. Multivariate Polynomial Equations as Ma.trix Eigenproblems. In Contributions in Numerical Math, ematics (1993), vol. 2 of Worhl Scientific Series in Applicable Analysis, pp. 355-371.
	18	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]
	19	TAKESHIIVIA: T., AND YOKOYAMA, K. A Solution of Systems of' Algebraic Equations - Application of Eigenvectol's of Linear Mal)s on Residue Class Rings. Comm.Symb.Alge.b.Manip. 6, 4 (1990), 27-36. (in Japanese).
	20	VAN DE.I~, ~VAERDEN: S. L. Moderne Algebra, v()l. II. Springer, 1931.
	21	Kazuhiro Yokoyama , Masayuki Noro , Taku Takeshima, Solutions of systems of algebraic equations and linear maps on residue class rings, Journal of Symbolic Computation, v.14 n.4, p.399-417, Oct. 1992 [doi>10.1016/0747-7171(92)90014-U]

CITED BY 3

	Barry H. Dayton , Zhonggang Zeng, Computing the multiplicity structure in solving polynomial systems, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, p.116-123, July 24-27, 2005, Beijing, China
	Itnuit Janovitz-Freireich , Lajos Rónyai , Ágnes Szántó, Approximate radical of ideals with clusters of roots, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
	Anton Leykin , Jan Verschelde , Ailing Zhao, Newton's method with deflation for isolated singularities of polynomial systems, Theoretical Computer Science, v.359 n.1, p.111-122, 14 August 2006