Computing parametric geometric resolutions
From MaRDI portal
Publication:1566400
DOI10.1007/s00200-002-0109-xzbMath1058.68123OpenAlexW2037381995MaRDI QIDQ1566400
Publication date: 2 June 2003
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-002-0109-x
complexitysymbolic computationNewton operatorparametric polynomial systemsalgebraic computationgeometric resolutions
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)
Related Items
An improvement of the rational representation for high-dimensional systems, A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Complexity results for triangular sets, A probabilistic algorithm for computing data-discriminants of likelihood equations, Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study, Blind algebraic identification of communication channels: symbolic solution algorithms, Polynomial equation solving by lifting procedures for ramified fibers, Fast Algorithms for Discrete Differential Equations, p-adic algorithm for bivariate Gröbner bases, Sparse resultants and straight-line programs, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, On the computation of rational solutions of underdetermined systems over a finite field, A concise proof of the Kronecker polynomial system solver from scratch, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Computing real radicals and \(S\)-radicals of polynomial systems, Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, On solving parametric polynomial systems, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, Bit-size estimates for triangular sets in positive dimension, Relaxed Hensel lifting of triangular sets, Solving parametric polynomial systems, Solving determinantal systems using homotopy techniques, Exact algorithms for semidefinite programs with degenerate feasible set, On the bit complexity of polynomial system solving, Elimination for generic sparse polynomial systems, Change of order for regular chains in positive dimension, Complexity of solving parametric polynomial systems, The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}, On sign conditions over real multivariate polynomials, A parametric representation of totally mixed Nash equilibria, On the complexity of the resolvent representation of some prime differential ideals, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, A geometric index reduction method for implicit systems of differential algebraic equations, On computing absolutely irreducible components of algebraic varieties with parameters, Finding new families of rank-one convex polynomials, A linear algebra approach to the differentiation index of generic DAE systems, A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications, Deformation techniques for sparse systems, Dynamic balancing of planar mechanisms using toric geometry, Fast computation of a rational point of a variety over a finite field, Solving parametric systems of polynomial equations over the reals through Hermite matrices
