Radical computations of zero-dimensional ideals and real root counting

Mathematics and Computers in Simulation

Volumn 42, Issue 4-6, 1996, Pages 561-569

  Backer, E ^a   Wormann T ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Decomposition of algebras; Radical of an ideal; Trace form

Indexed keywords

ALGEBRA; NUMBER THEORY; POLES AND ZEROS; POLYNOMIALS; PROBLEM SOLVING; ROOT LOCI;

COORDINATE ALGEBRA; DECOMPOSITION OF ALGEBRAS; ORDERED FIELDS; RADICAL OF AN IDEAL; REAL ROOT COUNTING; TRACE FORM; WEDDERBURN DECOMPOSITION;

COMPUTATIONAL METHODS;

EID: 0030285763     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0378-4754(96)00033-X     Document Type: Article

References (22)

1. W. Auzinger and H.J. Stetter, An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, Internat. Ser. Numer. Math. 86 (1988) 1-30.
2. E. Becker and T. Wörmann, On the trace formula for quadratic forms, Proc. RAGSQUAD (1992) Contemp. Math., To appear.
3. J.-P. Cardinal, Dualité et algorithmes itératifs pour la résolution de systémes polynomiaux, Thesis Rennes I, 1993.
4. D. Eisenbud and C. Huneke, A Jacobian method for finding the radical of an ideal, Preprint, 1989.
5. J.C. Faugére, P. Gianni, D. Lazard and T. Mora, Efficient computation of zero-dimensional Gröbner-bases by change of orderings, Unpublished manuscript, 1989.
6. F.R. Gantmacher, Matrizenrechnung I,II, VEB DVW (1979).
7. P. Gianni and M.B. Trager, Decomposition of Algebras, Lecture Notes in Computer Science, 356 (Springer, Berlin, 1988).
8. P. Gianni, B. Trager and G. Zacharias, Gröbner basis and primary decomposition of polynomial ideals, J. Symbolic Comput. 6 (1988) 149-167.
9. L. González Vega, La sucesion de Sturm - Habicht y sus aplicaciones al algebra computacional, Thesis Santander, 1989.
10. L. González Vega, H. Lombardi, T. Recio and M.-F. Roy, Sturm - Habicht sequence, Proc. ISSAC-89 (1989) 136-146.
11. L. González Vega and L.M. Pardo Vasallo, The computation of the radical for a zero-dimensional ideal in a polynomial ring through the determination of the trace of its quotient algebra, Preprint, 1993.
12. G. Heinig and K. Rost, Algebraic Methods for Toeplitz-like Matrices and Operators (Birkhäuser, Basel, 1984).
13. T. Krick and A. Logar, An algorithm for the computation of the radical of an ideal in the ring of polynomials, Proc. AAECC-9 (New Orleans), Lecture Notes in Computer Science 539 (Springer, Berlin, 1991) 195-205.
14. Y.N. Lakshman, On the complexity of computing a Gröbner basis for the radical of a zero-dimensional ideal, Proc. STOCS-90 (1990).
15. Y.N. Lakshman, A single exponential bound on the complexity of computing Gröbner basis zero-dimensional ideals, in: T. Mora and C. Traverso, eds., Effective Methods in Algebraic Geometry, Progress in Mathematics, Vol. 94 (Birkhäuser, Basel, 1991) 227-234.
16. Y.N. Lakshman and D. Lazard, On the complexity of zero-dimensional algebraic systems, in: T. Mora and C. Traverso, eds., Effective Methods in Algebraic Geometry, Progress in Mathematics, Vol. 94 (Birkhäuser, Basel, 1991) 217-225.
17. R. Neuhaus, Gröbner-basen and Anwendungen, Diplomarbeit Dortmund, 1989.
18. P. Pedersen, M.-F. Roy and A. Szpirglas, Counting real zeros in the multivariate case, in: F. Eyssette and A. Galligo, eds., Computational Algebraic Geometry (Birkhäuser, Basel, 1993) 203-223.
19. L. Ronyai, Computing the structure of finite algebras, in: E. Kaltofen, ed., Computational Algebraic Complexity, 9 (3) (Academic Press, New York, 1990).
20. G. Scheja and U. Storch, Über Spurfunktionen bei vollständigen Durchschnitten, J. Reine Angew. Math. 278/279 (1975) 174-190.
21. G. Scheja and U. Storch, Quasi - Frobenius-Algebren und lokal vollständige Durchschnitte, Manuscripta Math. 19 (1976) 75-104.
22. G. Scheja and U. Storch, Lehrbuch der Algebra, Band 2 (Teubner, Stuttgart, 1988).