Bibliography
Published online by Cambridge University Press: 05 August 2015
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Solving Polynomial Equation Systems III , pp. 267 - 272Publisher: Cambridge University PressPrint publication year: 2015
References
, , , The Design and Analysis of Computer Algorithms, Addison–Wesley (1974).
, , , , multiplicities and idempotents for zero dimensional systems, in Prog. Math. 143 (1996), pp. 1–16, Birkhäuser.Google Scholar
, Fonctions Interpolaires, Annales de M. Gergonne (1826).
, , Résolventes de Lagrange, Report LIPT 93.61 (1993),
, , Triangular set for solving polynomial systems: a comparative implementation of four methods, J. Symb. Comp. 28 (1999), 125–154.Google Scholar
, , Using Galois ideals for computing relative resolvents, J. Symb. Comp. 30 (2000), 635–651.Google Scholar
, , An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, in I.S.N.M. 86 (1988), pp. 11–30, Birkhäuser.Google Scholar
, , , , Multivariate Bezoutians, Kronecker symbol and Eisenbud–Levin formula, in Prog. Math. 143 (1996), pp. 79–104, Birkhäuser.Google Scholar
, Recherches sur le degré des équations résultantes de l'évanouissement des inconnues, et sur les moyens qu'il convient d'employer pour trouver ses équations, Mém. Acad. Roy. Sci. Paris (1764), 288–233.Google Scholar
, Théorie Generale des Èquations Algébriques, Pierres, Paris (1771).
, , Polynomial and Matrix Computations, Birkhäuser (1994).
, , , Fast algorithm for zero-dimensional polynomial systems using duality, J. AAECC 14 (2003), 239–272.Google Scholar
, , , Algebraic Complexity Theory, Springer (1997).
, Theory of Groups of Finite Order, Cambridge University Press (1911).
, Generalized characteristic polynomials, in L. N. Comp. Sci. 358 (1988), pp. 293–299, Springer.Google Scholar
, An effective algorithm for the sparse mixed resultant, in L. N. Comp. Sci. 673 (1993), pp. 89–104, Springer.Google Scholar
, Dualité et algorithms itératifs pour la résolution de systémes polynomiaux, Ph.D.thesis, University of Rennes I (1993).
, , Algebraic approach of residues and applications, in L. N. Appl. Math. 32 (1999), American Mathematical Society Press.Google Scholar
, Usage des fonctions interpolaires dans ls determination des fonctions symmetriques des racines d'une équation algébrique donnée, C.R. Acad. Sci. Paris 11 (1840), 933.Google Scholar
, Oeuvres t. V, Gauthier–Villars, Paris, (1882).
, Note sur la méthode d'élimination de Bezout, J. Reine Ang. Math. LIII (1857), 366–367.Google Scholar
, A fourth memoir upon quantics, Phil. Trans. Royal Soc. London CXLVIII (1858), 415–427.Google Scholar
, Un algorithm pour les calcul des resultants, in Prog. Math. 94 (1990), pp. 47–62, Birkhäuser.Google Scholar
, , , , Comprehensive triangular decomposition, in Proc. CASC 2007 (2007), pp. 73–101.Google Scholar
, Sur la complexité des représentations des systèmes polynomiaux: triangulation, méthodes modulaires, évaluation dynamique, Ph.D. thesis, École Polytechnique (2006).
, , Sharp estimates for triangular sets, in Proc. ISSAC'04 (2004), pp. 103–110, Association for Computing Machinery.
, , , , , Lifting techniques for triangular decomposition, in Proc. ISSAC'05 (2005), pp. 108–115.Google Scholar
, Sur les systèmes algébriques et leurs relations avec certains systèmes d'equations aux dérivées partielles. Ann. Éc. Norm. 3e série 14 (1897), 21–44.Google Scholar
, On a form of the eliminant of two quantics, Proc. London Math. Soc. 6 (1908a), 468–478.Google Scholar
, The eliminant of three quantics in two independent variables, Proc. London Math. Soc. 7 (1908b), 49–69.Google Scholar
, Some results in the theory of elimination, Proc. Roy. Soc. London 82 (1909), 468–478.Google Scholar
, Introductio in Analysin Infinitorum, Tom. 2, Lausanne, (1748).
, , Effective algorithms and bounds for Wu–Ritt characteristic sets, in Prog. Math. 94 (1990), pp. 119–142, Birkhäuser.Google Scholar
, , , Some constructions in rings of differential polynomials, in L. N. Comp. Sci. 539 (1991), pp. 171–182, Springer.Google Scholar
, Properties of GrÖbner bases under specialization, in L. N. Comp. Sci. 378 (1987), pp. 293–297, Springer.Google Scholar
, , Algorithmes – disons rapides – pour la décomposition d'une variété algébrique en composantes irréductibles, in Prog. Math. 94 (1990), pp. 169–194, Birkhäuser.Google Scholar
, , La detérmination des point isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, in Symp. Math. 34 (1993), pp. 216–256, Cambridge University Press.Google Scholar
, , Solving some overdetermined polynomial systems, in Proc. ISSAC'99 (1999), pp. 1–8, Association for Computing Machinery.Google Scholar
, , , , When polynomial equation systems can be “solved” fast?, in L. N. Comp. Sci. 948 (1995), pp. 205–231, Springer.Google Scholar
, , , , , , Lower bounds for diophantine approximation, J. Pure Appl. Algebra 117–118 (1997a), 277–311.Google Scholar
, , , , Le rôle des structures de données dans les problèmes d'élimination, C.R. Acad. Sci. Paris 325 (1997b), 1223–1228.Google Scholar
, , , , , Straight-line programs in geometric elimination theory, J. Pure Appl. Algebra 124 (1998), 101–146.Google Scholar
, , , , , The projective Noether maple package: computing the dimension of a projective variety, J. Symb. Comp. 30 (2000), 291–307.Google Scholar
, , , A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001), 154–211.Google Scholar
, , , Symbolic recipes for polynomial system solving, in Some Tapas of Computer Algebra, ed. , (1997), Springer.
, Sur la forme canonique des systèmes équations homogènes (in Russian)(Journal de l'Institut des Ponts et Chaussées de Russie), Izdanie Inst. In?z. Putej Soob?s?cenija Imp. Al. I. 84 (1913).Google Scholar
, Sur les caractéristiques des systémes d'équations aux dérivées partialles, C.R. Acad. Sci. Paris 156 (1913), 1147–1150.Google Scholar
, Sur la forme canonique des equations algébriques, C.R. Acad. Sci. Paris 157 (1913), 577–80.Google Scholar
, , , , On the intrinsic complexity of the arithmetic Nullstellensatz, J. Pure Appl. Algebra 146 (2000), 103–183.Google Scholar
, , Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving, Int. J. Algebra Comp. 21 (2011), 705–713.Google Scholar
, De eliminatione variabilis e duabus aequationibus algebraicas, J. Reine Ang. Math. XV (1836) 101–124.Google Scholar
, Le formalisme du résultant, Adv. Math. 90 117–263.
, Solving systems of algebraic equations by using Gröbner bases, in L. N. Comp. Sci. 378 (1987), pp. 282–292, Springer.Google Scholar
, Three contributions to elimination theory, Ph.D. thesis, Linz University (1991).
, A generic euclidean algorithm for computing triangular representations of algebraic varieties, J. Symb. Comp. 15 (1993), 153–167.Google Scholar
, On the stability of Gröbner bases under specialization, J. Symb. Comp. 24 (1997), 51–58.Google Scholar
, , An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors, Math. Comput. Sci. 2 (2009), 601–634.Google Scholar
, , Conditions for exact resultants using the Dixon resultant formulation, in Proc. ISSAC 2000 (2000), pp. 62–70, Association for Computing Machinery.Google Scholar
, , On the efficiency and optimality of Dixon-based resultant method, in Proc. ISSAC 2002 (2002), pp. 29–36, Association for Computing Machinery.Google Scholar
, , , Algebraic and geometric reasoning using Dixon resultants, in Proc. ISSAC 94 (1994), pp. 99–136, Association for Computing Machinery.Google Scholar
, , Extraneous factors in the Dixon resultant formulation, in Proc. ISSAC 97 (1997), pp. 141–148, Association for Computing Machinery.Google Scholar
, Computing the dimension of a polynomial ideal and membership in lowdimensional ideals. Master's thesis, Technische Universität München (2008).
, , Une approache informatique pour l'approximation diophantienne, C.R. Acad. Sci. Paris 318 (1994), 407–412.Google Scholar
, , A computational method for Diphantine approximation, in Prog. Math. 143 (1996), pp. 193–254, Birkhäuser.Google Scholar
Lakshman|Y.N., , On the complexity of zero-dimensional algebraic systems, in Prog. Math. 94 (1990), pp. 217–226, Birkhäuser.Google Scholar
, Algèbre linéaire sur K[X1, …, Xn] et élimination, Bull. Soc. Math. France 105 (1977), 165–190.Google Scholar
, Resolution des systemes d'equations algebriques, Theoret. Comput. Sci. 15 (1981), 77–110.Google Scholar
, A new method for solving algebraic systems of positive dimension, Disc. Appl. Math. 33 (1991), 147–160.Google Scholar
, Systems of algebraic equations (algorithms and complexity), Symp. Math. 34 (1993), 84–106, Cambridge University Press.Google Scholar
, Resolution of polynomial systems, in Proc. ASCM 2000 (2000), pp. 1–8, World Scientific.Google Scholar
, On the specification for solvers of polynomial systems, in Proc. ASCM 2001 (2001), pp. 1–10, World Scientific.Google Scholar
, Thirty years of polynomial system solving, and now?, J. Symb. Comp. 44 (2009), 222–239.Google Scholar
, Une alternative aux méthodes de réécriture pour résolution des systémes algébriques, Ph.D. thesis, École Polytechnique (2001).
, Complexity of comparing monomials and two improvements of the BMalgorithm, in L. N. Comp. Sci. 5393 (2008), pp. 105–125, Springer.Google Scholar
, Vector space bases associated to vanishing ideals of points, J. Pure Appl. Algebra 214 (2010), 309–321.Google Scholar
, The Algebraic Theory of Modular Systems, Cambridge University Press (1916).
, , Zur Behandlung algebraischer Gleichungssysteme mit dem Computer, preprint (1985).
, Systems of algebraic equations solved by means of endomorphisms, in L. N. Comp. Sci. 673 (1993a), pp. 43–56, Springer.Google Scholar
, On decomposing systems of polynomial equations with finitely many solutions, J. AAECC 4 (1993b), 217–230.Google Scholar
, , Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems, Num. Math. 70 (1995), 311–325.Google Scholar
, Computing the primary decomposition of zero-dimensional ideals, J. Symb. Comp. 34 (2002), 451–459.Google Scholar
, Resolución eficaz de systemas de ecuaciones polinomiales, Ph. D. thesis, University of Cantabria, Santander (1997).
, , Polynomial gcd computation over tower of algebraic extension, in L. N. Comp. Sci. 948 (1995), pp. 365–382, Springer.Google Scholar
, , On multiple zeros of systems of algebraic equations, in Proc. ISSAC'99 (1999), pp. 23–30, Association for Computing Machinery.Google Scholar
, A new criterion for normal form algorithms, in L. N. Comp. Sci. 1719 (1999), pp. 430–443, Springer.Google Scholar
, , Multivariate polynomials, duality and structured matrices, J. Complexity 16 (2000), 110–180.Google Scholar
, , Relation between roots and coefficients, interpolation and application to system solving, J. Symb. Comp. 33 (2002), 679–699.Google Scholar
, , Solving projective complete intersection faster, in Proc. ISSAC'00 (2000), pp. 234–241, Association for Computing Machinery.Google Scholar
, The Theory of Determinants in the Historical Order of Development, MacMillan (1906).
, Vorlesungen über Algebra, Zweiter Band Teubner (1900).
, How lower and upper complexity bounds meet in elimination, in L. N. Comp. Sci. 948 (1995), pp. 33–69, Springer.Google Scholar
, , On solving systems of algebraic equations via ideal bases and elimination, in Proc. 1981 SymSAC (1981), pp. 206–211, Association for Computing Machinery.Google Scholar
Mémoire sur l'élimination dans les équations algébriques, J. École Polytechnique t. IV (1802), 199–203.Google Scholar
, Combinatorial Identities, Wiley, (1968).
, Differential Equations from the Algebraic Standpoint, A.M.S. Colloquium Publications 14 (1932).
, Differential Algebra, A.M.S. Colloquium Publications 33 (1950).
, Sur les systémes d'équations aux dérivées partialles, C.R. Acad. Sci. Paris 157 (1913), 106–108.
, Algorithmes efficaces pour l'étude des zéros réels des systèmes polynomiaux, Ph.D. thesis, University of Rennes I (1996).
, Solving zero-dimensional systems through the Rational Univariate Representation, J. AAECC 9 (1999), 433–461.Google Scholar
, Lessons Introductory to the Modern Higher Algebra, Fifth Edn., Chelsea (1885).
, Computation with Finitely Presented Groups, Cambridge University Press (1994).
, Matrix eigenprobelms are at the heart of polynomial system solving, SIGSAM Bull. 30 (1996), 22–25.Google Scholar
, Numerical Polynomial Algebra, Tutorial Notes at ISSAC'98, Rostock (1998).
, Numerical Polynomial Algebra, SIAM (2004).
, A method of determining by mere inspection the derivatives from two equations of any degree, Phil. Mag. XVI (1840), 132–135.Google Scholar
, Memoir on the dialytic method of elimination. Part I.Phil. Mag. XXXI (1842), 534–539.Google Scholar
, On a theory of the syzygietic relations of two rational integral functions, comprising an application to the theory of Sturm's functions, and that of the greatest algebraic common measure, Phil. Trans. Royal Soc. London CXLIII (1853), 407–548.Google Scholar
, Buchberger Verfahren, Systeme algebraischer Gleichungen zu lösen, J. Numb. Theory 10 (1978), 475–488.Google Scholar
, Resolutions et functions symmetriques, in Proc. ISSAC'89 (1989), pp. 390–399, Association for Computing Machinery.Google Scholar
, Computation of the Galois groups of the resolvent factors for the direct and inverse Galois problems, in L. N. Comp. Sci. 948 (1995), pp. 456–468, Springer.Google Scholar
, Étude des relations algébriques entre les racines d'un polynôme d'une variable, Bull. Belg. Math. Soc. Simon Stevin 6 (1999), 507–535.Google Scholar
, Théorie de Galois constructive, Mémoir d'Habilitation, Paris (1998).
, Decomposing polynomial systems into simple systems, J. Symb. Comp. 25 (1998), 295–314.Google Scholar
, On the history of the Bezoutian and the resultant matrix, Linear Algebra Appl. 128 (1990), 27–34.Google Scholar
, On the decision problem and the mechanization of the theorem-proving in elementary geometry, Scinetia Sinica 21 (1978), 159–172.Google Scholar
, Basic principles of mechanical theorem proving in elementary geometry, J. Sys. Sci. & Math. Sci. 4 (1984), 207–235.Google Scholar
, On the decision problem and the mechanization of the theorem-proving in elementary geometry, in Contemp. Math. 29 (1984), pp. 213–234, American Mathematical Society.Google Scholar
, Some recent advances in mechanical theorem-proving of geometry, (reprinted) in Contemp. Math. 29 (1984), pp. 235–241, American Mathematical Society.Google Scholar
, A zero structure theorem for polynomial equations solving, M.M. Research Preprints 1 (1987), 2–12.Google Scholar
, Anwendung von Rewriting-Techniken in polyzyklischen Gruppen, Dissertation, Kaiserslautern (1989).
, , , Solutions of systems of algebraic equations and linear maps on residue class rings, J. Symb. Comp. 14 (1992), 399–417.Google Scholar
, , Commutative Algebra, Van Nostrand (1958).