A new method for solving algebraic systems of positive dimension

From MaRDI portal
Publication:1180160

DOI10.1016/0166-218X(91)90113-BzbMath0753.13013MaRDI QIDQ1180160

Daniel Lazard

Publication date: 27 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)




Related Items (44)

Complexity results for triangular setsChordality Preserving Incremental Triangular Decomposition and Its ImplementationApplications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systemsStability analysis for discrete biological models using algebraic methodsA generalized Euclidean algorithm for geometry theorem provingRational general solutions of higher order algebraic ODEsA Direttissimo Algorithm for Equidimensional DecompositionAnalyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zerosAlgorithms for computing triangular decomposition of polynomial systemsCharacteristic set algorithms for equation solving in finite fieldsDecomposing polynomial sets into simple sets over finite fields: the zero-dimensional caseComputing real radicals and \(S\)-radicals of polynomial systemsRational general solutions of trivariate rational differential systemsOn solving parametric polynomial systemsParametric equation solving and quantifier elimination in finite fields with the characteristic set methodOn the efficiency of solving Boolean polynomial systems with the characteristic set methodBit-size estimates for triangular sets in positive dimensionCharacteristic decomposition: from regular sets to normal setsRelaxed Hensel lifting of triangular setsAn equivalence theorem for regular differential chainsComputing strong regular characteristic pairs with Gröbner basesOn computer-assisted classification of coupled integrable equationsA note on upper bounds for ideal-theoretic problemsAn algorithm for decomposing a polynomial system into normal ascending setsChange of order for regular chains in positive dimensionA systematic framework for solving geometric constraints analyticallyDecomposition plans for geometric constraint systems. I: Performance measures for CADUnmixed-dimensional decomposition of a finitely generated perfect differential idealAn alternative algorithm for computing the pseudo-remainder of multivariate polynomialsOn the links between triangular sets and dynamic constructible closureAn Algorithm for Transforming Regular Chain into Normal ChainMode decomposition of global bifurcation diagram with Gröbner basesProperness defects of projection and minimal discriminant varietyDecomposition of polynomial sets into characteristic pairsA characteristic set method for ordinary difference polynomial systemsOn the theories of triangular setsTriangular sets for solving polynomial systems: a comparative implementation of four methodsFast arithmetic for triangular sets: from theory to practiceExamples of using dynamic constructible closure.On the complexity of counting components of algebraic varietiesComputing differential characteristic sets by change of orderingComputing triangular systems and regular systemsMultiplicity-preserving triangular set decomposition of two polynomialsAnalyses and implementations of chordality-preserving top-down algorithms for triangular decomposition



Cites Work


This page was built for publication: A new method for solving algebraic systems of positive dimension