On the theories of triangular sets

From MaRDI portal

Publication:1808664

Jump to:navigation, search

zbMath0943.12003MaRDI QIDQ1808664

Daniel Lazard, Marc Moreno Maza, Philippe Aubry

Publication date: 5 September 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

multivariate polynomials triangular sets polynomial equation systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99)

Related Items

Commissioning rules for optimal velocity controller damping of servo axes using elimination methods, Algorithms to compute the topology of orientable real algebraic surfaces, Complexity results for triangular sets, Chordality Preserving Incremental Triangular Decomposition and Its Implementation, On the connection between Ritt characteristic sets and Buchberger-Gröbner bases, Automatic constructibility checking of a corpus of geometric construction problems, Recent Advances in Real Geometric Reasoning, Computing with algebraically closed fields, Using jointly geometry and algebra to determine RC-constructibility, Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems, Solving multi-linear systems with \(\mathcal {M}\)-tensors, A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity, Modular composition modulo triangular sets and applications, Rational general solutions of higher order algebraic ODEs, Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics, Parallelization of triangular decompositions: techniques and implementation, Chordal Networks of Polynomial Ideals, A Direttissimo Algorithm for Equidimensional Decomposition, Involutions of polynomially parametrized surfaces, An improved algorithm for deciding semi-definite polynomials, Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros, A signature-based algorithm for computing the nondegenerate locus of a polynomial system, Algorithms for computing triangular decomposition of polynomial systems, Characteristic set algorithms for equation solving in finite fields, CAD and topology of semi-algebraic sets, Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case, Squarefree normal representation of zeros of zero-dimensional polynomial systems, Chordal graphs in triangular decomposition in top-down style, Generic regular decompositions for parametric polynomial systems, Algorithmic Thomas decomposition of algebraic and differential systems, Thomas Decomposition and Nonlinear Control Systems, Rational general solutions of trivariate rational differential systems, On solving parametric polynomial systems, A complete algorithm for counting real solutions of polynomial systems of equations and inequalities., Parametric equation solving and quantifier elimination in finite fields with the characteristic set method, On the efficiency of solving Boolean polynomial systems with the characteristic set method, When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?, Bit-size estimates for triangular sets in positive dimension, A criterion for testing whether a difference ideal is prime, Characteristic decomposition: from regular sets to normal sets, Ritt-Wu characteristic set method for Laurent partial differential polynomial systems, On the mechanization of straightedge and compass constructions, Elimination theory in differential and difference algebra, Triangular systems and a generalization of primitive polynomials, Relaxed Hensel lifting of triangular sets, Solving parametric polynomial systems, Tensor inversion and its application to the tensor equations with Einstein product, Some constructions for real algebraic curves, An equivalence theorem for regular differential chains, Computing strong regular characteristic pairs with Gröbner bases, On computer-assisted classification of coupled integrable equations, An algorithm for decomposing a polynomial system into normal ascending sets, A moment approach to analyze zeros of triangular polynomial sets, On approximate triangular decompositions in dimension zero, A test for monomial containment, Change of order for regular chains in positive dimension, A systematic framework for solving geometric constraints analytically, The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}, A normal form algorithm for regular differential chains, On the links between triangular sets and dynamic constructible closure, An Algorithm for Transforming Regular Chain into Normal Chain, Probabilistic algorithms for computing resolvent representations of regular differential ideals, Identifying the parametric occurrence of multiple steady states for some biological networks, A short contribution to the theory of regular chains, Clustering complex zeros of triangular systems of polynomials, Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity, Decomposition of polynomial sets into characteristic pairs, A characteristic set method for ordinary difference polynomial systems, Triangular sets for solving polynomial systems: a comparative implementation of four methods, Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition, Complete numerical isolation of real roots in zero-dimensional triangular systems, Fast arithmetic for triangular sets: from theory to practice, On the complexity of counting components of algebraic varieties, Characteristic set method for differential-difference polynomial systems, Dynamic balancing of planar mechanisms using toric geometry, Factorization-free decomposition algorithms in differential algebra, Computing differential characteristic sets by change of ordering, Whitney's theorem, triangular sets, and probabilistic descent on manifolds, Symbolic computation for the qualitative theory of differential equations, Computing triangular systems and regular systems, Generic regular decompositions for generic zero-dimensional systems, Accelerated tower arithmetic, Multiplicity-preserving triangular set decomposition of two polynomials, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Comprehensive LU Factors of Polynomial Matrices, On the Chordality of Simple Decomposition in Top-Down Style, Specifications for triangulation algorithms of elementary-algebraic systems, Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition, An algorithm for isolating the real solutions of semi-algebraic systems, Real solving for positive dimensional systems.

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1808664&oldid=14170906"