Computing triangular systems and regular systems

From MaRDI portal
Publication:1582304

DOI10.1006/jsco.1999.0355zbMath1007.65039OpenAlexW2031245794WikidataQ56602968 ScholiaQ56602968MaRDI QIDQ1582304

Dongming Wang

Publication date: 9 March 2003

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

Full work available at URL: https://doi.org/10.1006/jsco.1999.0355



Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).


Related Items (40)

Recent Advances in Real Geometric ReasoningApplications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systemsA new approach for constructing subresultantsStability analysis for discrete biological models using algebraic methodsSymbolic computation of the orthogonal projection of rational curves onto rational parameterized surfacesThe maximum number and its distribution of singular points for parametric piecewise algebraic curvesChordal Networks of Polynomial IdealsAnalyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zerosBifurcation analysis and complex dynamics of a Kopel triopoly modelDecomposing polynomial sets into simple sets over finite fields: the zero-dimensional caseSquarefree normal representation of zeros of zero-dimensional polynomial systemsComputing intersection and self-intersection loci of parametrized surfaces using regular systems and Gröbner basesChordal graphs in triangular decomposition in top-down styleGeneric regular decompositions for parametric polynomial systemsWhen does \(\langle T \rangle\) equal \(\text{sat}(T)\)?Solving parametric piecewise polynomial systemsComputing equilibria of semi-algebraic economies using triangular decomposition and real solution classificationAn algebraic method to calculate parameter regions for constrained steady-state distribution in stochastic reaction networksCharacteristic decomposition: from regular sets to normal setsElimination theory in differential and difference algebraTriangular systems and a generalization of primitive polynomialsAn equivalence theorem for regular differential chainsComputing strong regular characteristic pairs with Gröbner basesReal solution isolation using interval arithmeticA moment approach to analyze zeros of triangular polynomial setsA test for monomial containmentComputing Switching Surfaces in Optimal Control Based on Triangular DecompositionProperties of regular systems and algorithmic improvements for regular decompositionAn alternative algorithm for computing the pseudo-remainder of multivariate polynomialsProperness defects of projection and minimal discriminant varietyAn Incremental Algorithm for Computing Cylindrical Algebraic DecompositionsCounting positive solutions for polynomial systems with real coefficientsDecomposition of polynomial sets into characteristic pairsExploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decompositionReal zeros of the zero-dimensional parametric piecewise algebraic varietyGeneric regular decompositions for generic zero-dimensional systemsMultiplicity-preserving triangular set decomposition of two polynomialsOn the Chordality of Simple Decomposition in Top-Down StyleAn algorithm for isolating the real solutions of semi-algebraic systemsHeuristics to sift extraneous factors in Dixon resultants



Cites Work


This page was built for publication: Computing triangular systems and regular systems